Regulated Nondeterminism in Pushdown Automata

DOI10.1007/978-3-540-76336-9_10zbMath1139.68370OpenAlexW1594261562MaRDI QIDQ3503897

Andreas Malcher, Larissa Werlein, Martin Kutrib

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_10

zbMATH Keywords

closure propertieslimited nondeterminismpushdown automataregulated nondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Context-dependent nondeterminism for pushdown automata
• On measuring nondeterminism in regular languages
• Amounts of nondeterminism in finite automata
• On the relation between ambiguity and nondeterminism in finite automata
• Measures of nondeterminism for pushdown automata
• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Measuring nondeterminism in pushdown automata
• On reducing the number of stack symbols in a PDA
• Real-time computations with restricted nondeterminism
• Regular Closure of Deterministic Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regulated Nondeterminism in Pushdown Automata