Refining nondeterminism in context-free languages

DOI10.1007/BF01776563MaRDI QIDQ4174256zbMATH OpenFDO

Authors Chandra M. R. Kintala

Publication date 1978

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01776563

zbMATH Keywords

HierarchiesNondeterminismUnambiguous Context-Free Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• An infinite hierarchy of intersections of context-free languages
• Deterministic context free languages
• scientific article; zbMATH DE number 3426894 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)

Cited in

(7)

• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Counter machines and crystallographic structures
• Measuring nondeterminism in pushdown automata
• In memoriam Chandra Kintala
• Strict interpretations of deterministic pushdown acceptors
• Measuring nondeterminism in pushdown automata
• Pushdown automata with bounded nondeterminism and bounded ambiguity

This page was built for publication: Refining nondeterminism in context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174256)