Regulated Nondeterminism in Pushdown Automata
From MaRDI portal
Recommendations
Cites work
- Amounts of nondeterminism in finite automata
- Context-dependent nondeterminism for pushdown automata
- 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 1995125 (Why is no real title available?)
- scientific article; zbMATH DE number 2068877 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1886071 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Measures of nondeterminism for pushdown automata
- Measuring nondeterminism in pushdown automata
- On measuring nondeterminism in regular languages
- On reducing the number of stack symbols in a PDA
- On the relation between ambiguity and nondeterminism in finite automata
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- Real-time computations with restricted nondeterminism
- Regular Closure of Deterministic Languages
- Regulated pushdown automata
Cited in
(7)- Regulated pushdown automata
- Regulated nondeterminism in pushdown automata: the non-regular case
- Context-Dependent Nondeterminism for Pushdown Automata
- scientific article; zbMATH DE number 1886071 (Why is no real title available?)
- scientific article; zbMATH DE number 6606350 (Why is no real title available?)
- Regulated nondeterminism in pushdown automata
- Context-dependent nondeterminism for pushdown automata
This page was built for publication: Regulated Nondeterminism in Pushdown Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503897)