One-sided forbidding grammars and selective substitution grammars

DOI10.1080/00207160.2011.642300zbMath1255.68090OpenAlexW2025836592MaRDI QIDQ4903559

Petr Zemek, Alexander Meduna

Publication date: 22 January 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2011.642300

zbMATH Keywords

regulated rewritinggenerative powerformal language theoryselective substitution grammarsone-sided forbidding grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets ⋮ One-Sided Random Context Grammars: A Survey ⋮ Generalized one-sided forbidding grammars ⋮ Fuzzy state grammar and fuzzy deep pushdown automaton

Cites Work

• One-sided random context grammars
• On the generative power of regular pattern grammars
• On infinite words obtained by selective substitution grammars
• On coordinated selective substitutions: Towards a unified theory of grammars and machines
• Adding global forbidding context to context-free grammars
• Selective substitution array grammars
• Context-free like restrictions on selective rewriting
• ETOL-grammars and N-grammars
• Forbidding ET0L grammars.
• A shrinking lemma for random forbidding context languages
• Formal languages and applications.
• Generalized forbidding grammars
• ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS
• Closure properties of selective substitution grammars part I
• Closure properties of selective substitution grammars
• Sequential, continuous and parallel grammars