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.

@article{Vaszil07,
  title = {Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components},
  author = {György Vaszil},
  year = {2007},
  tags = {context-aware, grammar},
  researchr = {https://researchr.org/publication/Vaszil07},
  cites = {0},
  citedby = {0},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume = {12},
  number = {1-2},
  pages = {307-315},
}