VOLUME 12 2007 NUMBERS 1–2

Non-Returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components
György Vaszil
Pages 307–315





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2007-307,
  author  = {Gy{\"{o}}rgy Vaszil},
  title   = {Non-Returning {PC} Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {12},
  number  = {1--2},
  pages   = {307--315},
  year    = {2007},
  url     = {https://doi.org/10.25596/jalc-2007-307},
  doi     = {10.25596/jalc-2007-307}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: parallel communicating grammar systems, recursively enumerable languages, descriptional complexity
DOI: 10.25596/jalc-2007-307