Pages that link to "Item:Q3395134"
From MaRDI portal
The following pages link to DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134):
Displaying 16 items.
- Deterministic two-way one-head pushdown automata are very powerful (Q800088) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Investigations on Automata and Languages over a Unary Alphabet (Q3192250) (← links)
- Unary Languages Recognized by Two-Way One-Counter Automata (Q3192259) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- (Q4240336) (← links)
- (Q4536396) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
- SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
- LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← 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 (Q5920129) (← links)