On reducing the number of states in a PDA

DOI10.1007/BF01786988zbMath0487.68047OpenAlexW2019570031MaRDI QIDQ3948599

Detlef Wotschke, Jonathan Goldstine, John K. Price

Publication date: 1982

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01786988

zbMATH Keywords

transformationpushdown automatonloss of deterministic behaviorrealtime behavior

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Generating all permutations by context-free grammars in Greibach normal form ⋮ Detecting useless transitions in pushdown automata ⋮ Digging input-driven pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pushdown automaton or a context-free grammar - which is more economical?
• Optimization of LR(k) parsers
• Mappings which preserve context sensitive languages
• Complexity and unambiguity of context-free grammars and languages
• On context-free languages and push-down automata