Measuring nondeterminism in pushdown automata
From MaRDI portal
Publication:5048932
Recommendations
Cites work
- scientific article; zbMATH DE number 3839323 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 193480 (Why is no real title available?)
- scientific article; zbMATH DE number 1995125 (Why is no real title available?)
- A parsing automata approach to LR theory
- Measures of nondeterminism for pushdown automata
- On measuring nondeterminism in regular languages
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- Refining nondeterminism in context-free languages
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)