scientific article; zbMATH DE number 1759446
From MaRDI portal
Publication:4536396
Recommendations
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- Unary pushdown automata and straight-line programs
- Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
- Deterministic Pushdown Automata and Unary Languages
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
- Unboundedness and downward closures of higher-order pushdown automata
- Descriptional complexity of unambiguous input-driven pushdown automata
- Alternation bounded auxiliary pushdown automata
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- Pushdown automata with bounded nondeterminism and bounded ambiguity
Cited in
(5)- scientific article; zbMATH DE number 4209587 (Why is no real title available?)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
- scientific article; zbMATH DE number 4114061 (Why is no real title available?)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- scientific article; zbMATH DE number 4131657 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536396)
