Prefix pushdown automata and their simplification

DOI10.1080/00207169908804789zbMath0934.68054OpenAlexW2034043434MaRDI QIDQ4254588

Alexander Meduna

Publication date: 29 June 1999

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

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

zbMATH Keywords

prefix pushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• On the generative power of regular pattern grammars
• Context free derivations on word monoids
• Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
• Generalized forbidding grammars

This page was built for publication: Prefix pushdown automata and their simplification