Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components

György Vaszil. Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components. Journal of Automata, Languages and Combinatorics, 12(1-2):307-315, 2007.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.