Measures of nondeterminism for pushdown automata
From MaRDI portal
Publication:1337469
DOI10.1016/S0022-0000(05)80054-6zbMATH Open0822.68070MaRDI QIDQ1337469FDOQ1337469
Authors: Kai Salomaa, Sheng Yu 
Publication date: 9 October 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Amounts of nondeterminism in finite automata
- Title not available (Why is that?)
- On measuring nondeterminism in regular languages
- Intercalation theorems for stack languages
- Title not available (Why is that?)
- A pumping lemma for deterministic context-free languages
- Title not available (Why is that?)
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)
