Measuring nondeterminism in pushdown automata
DOI10.1007/BFB0023467zbMATH Open1498.68137OpenAlexW1523939218MaRDI QIDQ5048932FDOQ5048932
Authors: Jonathan Goldstine, Detlef Wotschke, Hing-Man Leung 
Publication date: 9 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0023467
Recommendations
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On measuring nondeterminism in regular languages
- A parsing automata approach to LR theory
- Measures of nondeterminism for pushdown automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Refining nondeterminism in context-free languages
- Pushdown automata with bounded nondeterminism and bounded ambiguity
Cited In (6)
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- A Measure for the Degree of Nondeterminism of Context-Free Languages
- Measures of nondeterminism for pushdown automata
- Nondeterminism degrees for context-free languages
- On measuring nondeterminism in regular languages
- Measuring nondeterminism in pushdown automata
This page was built for publication: Measuring nondeterminism in pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048932)
