Refining nondeterminism in context-free languages
From MaRDI portal
Publication:4174256
DOI10.1007/BF01776563zbMath0392.68063MaRDI QIDQ4174256
Publication date: 1978
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Related Items
IN MEMORIAM CHANDRA KINTALA, Pushdown automata with bounded nondeterminism and bounded ambiguity, Counter machines and crystallographic structures, Measuring nondeterminism in pushdown automata, Pushdown automata with bounded nondeterminism and bounded ambiguity, Strict interpretations of deterministic pushdown acceptors, Measuring nondeterminism in pushdown automata
Cites Work
