On acceptors of iteration languages

DOI10.1080/00207167908803152zbMath0408.68072OpenAlexW2121055433MaRDI QIDQ4195973

Dirk Vermeir, Grzegorz Rozenberg

Publication date: 1979

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167908803152

zbMATH Keywords

Pushdown AutomataAcceptors of Iteration LanguagesBottom-Up AcceptanceParallel Rewrite GrammarsRecursively Enumerable Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Extended macro grammars and stack controlled machines

Cites Work

• Unnamed Item
• On a family of acceptors for some classes of developmental languages
• A note on a family of acceptors for some families of developmental languages†
• Some characterizations of lindenmayer systems in terms of chomsky-type grammars and stack machines