Forbidding ET0L grammars.

DOI10.1016/S0304-3975(03)00322-0zbMath1060.68056MaRDI QIDQ1426468

Martin Švec, Alexander Meduna

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

ET0L and E0L grammarsForbidding context conditionsGenerative power

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ One-sided forbidding grammars and selective substitution grammars ⋮ On the descriptional complexity of some rewriting mechanisms regulated by context conditions ⋮ Equivalent language models that closely simulate one another and their illustration in terms ofLsystems ⋮ Nonterminal complexity of tree controlled grammars ⋮ Improved descriptional complexity results on generalized forbidding grammars

Cites Work

• ETOL-grammars and N-grammars
• Node-label controlled graph grammars with context conditions
• Generalized forbidding grammars
• One-sided and two-sided context in formal grammars
• Descriptional Complexity Of Generalized Forbidding Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forbidding ET0L grammars.