Pushdown automata with bounded nondeterminism and bounded ambiguity

DOI10.1007/3-540-59175-3_102zbMath1495.68123OpenAlexW2179958148MaRDI QIDQ5096344

Christian Herzog

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_102

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Measuring nondeterminism in pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On measuring nondeterminism in regular languages
• A pumping lemma for deterministic context-free languages
• Amounts of nondeterminism in finite automata
• A note on the succinctness of descriptions of deterministic languages
• Succinctness of Descriptions of Unambiguous Context-Free Languages
• Refining nondeterminism in context-free languages

This page was built for publication: Pushdown automata with bounded nondeterminism and bounded ambiguity