Pages that link to "Item:Q1853167"
From MaRDI portal
The following pages link to Simulating finite automata with context-free grammars. (Q1853167):
Displayed 7 items.
- Finite state complexity (Q719308) (← links)
- A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- Chrobak Normal Form Revisited, with Applications (Q5200060) (← links)