Regulated nondeterminism in pushdown automata

DOI10.1016/j.tcs.2009.06.002zbMath1194.68142OpenAlexW2092069299MaRDI QIDQ840763

Andreas Malcher, Larissa Werlein, Martin Kutrib

Publication date: 14 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.002

zbMATH Keywords

context-free languageslimited nondeterminismpushdown automatacomputational capacityclosures of languagescontext-dependent nondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

IN MEMORIAM CHANDRA KINTALA

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
• Erasable context-free languages
• Real-time computations with restricted nondeterminism
• Regular Closure of Deterministic Languages
• An Infinite Hierarchy of Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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