The following pages link to (Q4088273):
Displaying 6 items.
- Abstract grammars based on transductions (Q1176481) (← links)
- The membership question for ETOL-languages is polynomially complete (Q1219165) (← links)
- ETOL-grammars and N-grammars (Q1219692) (← links)
- On the complexity of formal grammars (Q1239000) (← links)
- A useful lemma for context-free programmed grammars (Q1256864) (← links)
- Petri net algorithms in the theory of matrix grammars (Q1342504) (← links)
