The following pages link to (Q4105792):
Displayed 6 items.
- Complexity of normal form grammars (Q799380) (← links)
- Comparison of some descriptional complexities of 0L systems obtained by a unifying approach (Q948077) (← links)
- Data representation and computational complexity (Q1132872) (← links)
- A pushdown automaton or a context-free grammar - which is more economical? (Q1165026) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Small Universal Devices (Q2944894) (← links)