Pages that link to "Item:Q1165026"
From MaRDI portal
The following pages link to A pushdown automaton or a context-free grammar - which is more economical? (Q1165026):
Displayed 7 items.
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Generating all permutations by context-free grammars in Greibach normal form (Q2378538) (← links)
- On reducing the number of stack symbols in a PDA (Q3141998) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- On reducing the number of states in a PDA (Q3948599) (← links)