ETOL-grammars and N-grammars
From MaRDI portal
Publication:1219692
DOI10.1016/0020-0190(75)90052-6zbMath0312.68045MaRDI QIDQ1219692
Publication date: 1975
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(75)90052-6
68Q45: Formal languages and automata
Related Items
Multi grammars, One-sided forbidding grammars and selective substitution grammars, On the Degree of Team Cooperation in CD Grammar Systems, The bounded degree problem for NLC grammars is decidable, Adding global forbidding context to context-free grammars, More on ETOL systems versus random context grammars, Forbidding ET0L grammars., Generalized one-sided forbidding grammars, Generalized forbidding grammars, Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
Cites Work
- On TOL languages over terminals
- The membership question for ETOL-languages is polynomially complete
- L systems
- Extension of tabled 0L-systems and languages
- Grammars with partial ordering of the rules
- Programmed Grammars and Classes of Formal Languages
- Some remarks on state grammars and matrix grammars
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item