22
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages

Pages 67-83 | Received 27 Jul 1996, Published online: 20 Mar 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Alexander Meduna. (1999) Middle quotients of linear languages. International Journal of Computer Mathematics 71:3, pages 319-335.
Read now
Alexander Meduna. (1999) Prefix pushdown automata and their simplification. International Journal of Computer Mathematics 71:1, pages 1-20.
Read now

Articles from other publishers (7)

Alexander Meduna & Ondřej SoukupAlexander Meduna & Ondřej Soukup. 2017. Modern Language Models and Computation. Modern Language Models and Computation 513 522 .
Alexander Meduna & Petr ZemekAlexander Meduna & Petr Zemek. 2014. Regulated Grammars and Automata. Regulated Grammars and Automata 653 668 .
György Vaszil. (2005) On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theoretical Computer Science 330:2, pages 361-373.
Crossref
Henning Fernau. (2003) Nonterminal complexity of programmed grammars. Theoretical Computer Science 296:2, pages 225-251.
Crossref
Henning Fernau & Alexander Meduna. (2003) On the degree of scattered context-sensitivity. Theoretical Computer Science 290:3, pages 2121-2124.
Crossref
Henning Fernau. 2001. Machines, Computations, and Universality. Machines, Computations, and Universality 202 213 .
Alexander Meduna. (2000) Terminating left-hand sides of scattered context productions M. Nivat. Theoretical Computer Science 237:1-2, pages 423-427.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.