VOLUME 4 1999 NUMBER 2
Characterizations of Recursively Enumerable Languages by Programmed Grammars with Unconditional Transfer
Henning Fernau, Frank Stephan
Pages 117–142



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-1999-117,
  author  = {Henning Fernau and Frank Stephan},
  title   = {Characterizations of Recursively Enumerable Languages by Programmed Grammars with Unconditional Transfer},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {4},
  number  = {2},
  pages   = {117--142},
  year    = {1999},
  url     = {https://doi.org/10.25596/jalc-1999-117},
  doi     = {10.25596/jalc-1999-117}
}
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: programmed grammars, unconditional transfer, leftmost derivation, non-effective construction
DOI: 10.25596/jalc-1999-117