On reducing the number of stack symbols in a PDA

DOI10.1007/BF01189852zbMath0793.68103OpenAlexW2023445075MaRDI QIDQ3141998

John K. Price, Detlef Wotschke, Jonathan Goldstine

Publication date: 21 August 1994

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

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

zbMATH Keywords

nondeterminismpushdown automatondeterminism-preserving transformations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Regulated nondeterminism in pushdown automata ⋮ Regulated Nondeterminism in Pushdown Automata ⋮ Detecting useless transitions in pushdown automata ⋮ Digging input-driven pushdown automata

Cites Work

• Unnamed Item
• On Goedel speed-up and succinctness of language representations
• On measuring nondeterminism in regular languages
• Amounts of nondeterminism in finite automata
• A pushdown automaton or a context-free grammar - which is more economical?
• Regularity and Related Problems for Deterministic Pushdown Automata
• A note on the succinctness of descriptions of deterministic languages
• Succinctness of Descriptions of Unambiguous Context-Free Languages
• A regularity test for pushdown machines
• An Infinite Hierarchy of Context-Free Languages

This page was built for publication: On reducing the number of stack symbols in a PDA