Pages that link to "Item:Q1872711"
From MaRDI portal
The following pages link to Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711):
Displaying 23 items.
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits (Q1892887) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Undecidability of the emptiness problem for context-free picture languages (Q2357111) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (Q2947427) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- (Q4536396) (← links)
- Non-Self-Embedding Grammars and Descriptional Complexity (Q5164870) (← links)
- SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)
- Push complexity: optimal bounds and unary inputs (Q6666805) (← links)