Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 53, 1994 - Issue 1-2
Submit an article Journal homepage
16
Views
16
CrossRef citations to date
0
Altmetric
Original Articles

Accepting grammars with regulation

Henning Bordihn Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Postfach 4120, Magdeburg, D-39016, Germany E-mail: [email protected]
&
Henning Fernau Lehrstuhl Informatik für Ingenieure und Naturwissenschaftler, Universität Karlsruhe (TH), Am Fasanengarten 5, Karlsruhe, D-76128, Germany E-mail: [email protected]
Pages 1-18 | Received 31 Mar 1994, Published online: 19 Mar 2007

Citations (16)

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

Subscribe to citation updates

Read on this site (1)

Henning Fernau & Henning Bordihn. (1995) Remarks on accepting parallel systems. International Journal of Computer Mathematics 56:1-2, pages 51-67.
Read now

Articles from other publishers (15)

Henning Fernau & Martin Vu. 2019. Descriptional Complexity of Formal Systems. Descriptional Complexity of Formal Systems 124 136 .
Alexander Meduna & Ondřej SoukupAlexander Meduna & Ondřej Soukup. 2017. Modern Language Models and Computation. Modern Language Models and Computation 425 431 .
Alexander Meduna & Petr ZemekAlexander Meduna & Petr Zemek. 2014. Regulated Grammars and Automata. Regulated Grammars and Automata 281 328 .
Henning Fernau. 2012. Languages Alive. Languages Alive 75 85 .
Alexander Meduna & Petr Zemek. (2011) Workspace theorems for regular-controlled grammars. Theoretical Computer Science 412:35, pages 4604-4612.
Crossref
Henning Bordihn & Markus Holzer. (2006) Programmed grammars and their relation to the LBA problem. Acta Informatica 43:4, pages 223-242.
Crossref
ZBYNĚK KŘIVKA, ALEXANDER MEDUNA & RUDOLF SCHÖNECKER. (2011) GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA. International Journal of Foundations of Computer Science 17:05, pages 1223-1229.
Crossref
Henning Fernau. (2003) Nonterminal complexity of programmed grammars. Theoretical Computer Science 296:2, pages 225-251.
Crossref
Henning Bordihn, Júrgen Dassow & Gyorgy Vaszil. 1999. Fundamentals of Computation Theory. Fundamentals of Computation Theory 136 147 .
Henning Fernau & Dietmar Wätjen. (1998) Remarks on regulated limited ETOL systems and regulated context-free grammars. Theoretical Computer Science 194:1-2, pages 35-55.
Crossref
Jürgen Dassow, Gheorghe Păun & Grzegorz Rozenberg. 1997. Handbook of Formal Languages. Handbook of Formal Languages 155 213 .
Jürgen Dassow, Gheorghe Păun & Arto Salomaa. 1997. Handbook of Formal Languages. Handbook of Formal Languages 101 154 .
Henning Bordihn. 1997. New Trends in Formal Languages. New Trends in Formal Languages 1 9 .
Henning Fernau. 1996. Mathematical Foundations of Computer Science 1996. Mathematical Foundations of Computer Science 1996 348 359 .
Henning Fernau. (1995) A note on uniformly limited ETOL systems with unique interpretation. Information Processing Letters 54:4, pages 199-204.
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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.