ETOL-grammars and N-grammars

DOI10.1016/0020-0190(75)90052-6zbMath0312.68045OpenAlexW2055334547MaRDI QIDQ1219692

Martti Penttonen

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Adding global forbidding context to context-free grammars ⋮ Generalized forbidding grammars ⋮ Forbidding ET0L grammars. ⋮ Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems ⋮ One-sided forbidding grammars and selective substitution grammars ⋮ More on ETOL systems versus random context grammars ⋮ The bounded degree problem for NLC grammars is decidable ⋮ On the Degree of Team Cooperation in CD Grammar Systems ⋮ Multi grammars ⋮ Generalized one-sided forbidding grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: ETOL-grammars and N-grammars