Measures of nondeterminism for pushdown automata
From MaRDI portal
(Redirected from Publication:1337469)
Recommendations
Cites work
- scientific article; zbMATH DE number 3839323 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 4117885 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A pumping lemma for deterministic context-free languages
- Amounts of nondeterminism in finite automata
- Intercalation theorems for stack languages
- On measuring nondeterminism in regular languages
Cited in
(12)- Deciding path size of nondeterministic (and input-driven) pushdown automata
- Regulated nondeterminism in pushdown automata
- Context-dependent nondeterminism for pushdown automata
- Measuring nondeterminism in pushdown automata
- Nondeterminism degrees for context-free languages
- Regulated Nondeterminism in Pushdown Automata
- Pushdown automata free of explicit nondeterminism and an infinite hierarchy of context-free languages
- Pumping and pushdown machines
- Measuring nondeterminism in pushdown automata
- In memoriam Chandra Kintala
- Oracle pushdown automata, nondeterministic reducibilities, and the hierarchy over the family of context-free languages
- Deep pushdown automata
This page was built for publication: Measures of nondeterminism for pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337469)
