Measures of nondeterminism for pushdown automata

DOI10.1016/S0022-0000(05)80054-6zbMath0822.68070MaRDI QIDQ1337469

Kai Salomaa, Sheng Yu

Publication date: 9 October 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

context-free languagespushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Regulated nondeterminism in pushdown automata ⋮ IN MEMORIAM CHANDRA KINTALA ⋮ Context-dependent nondeterminism for pushdown automata ⋮ Regulated Nondeterminism in Pushdown Automata ⋮ Pumping and pushdown machines ⋮ Measuring nondeterminism in pushdown automata ⋮ Measuring nondeterminism in pushdown automata ⋮ Deciding path size of nondeterministic (and input-driven) pushdown automata

Cites Work

• On measuring nondeterminism in regular languages
• A pumping lemma for deterministic context-free languages
• Amounts of nondeterminism in finite automata
• Intercalation theorems for stack languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item