One-sided forbidding grammars and selective substitution grammars
From MaRDI portal
Publication:4903559
DOI10.1080/00207160.2011.642300zbMATH Open1255.68090OpenAlexW2025836592MaRDI QIDQ4903559FDOQ4903559
Authors: Alexander Meduna, Petr Zemek 
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
Recommendations
regulated rewritinggenerative powerformal language theoryselective substitution grammarsone-sided forbidding grammars
Cites Work
- A shrinking lemma for random forbidding context languages
- ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS
- One-sided random context grammars
- ETOL-grammars and N-grammars
- Formal languages and applications.
- Forbidding ET0L grammars.
- On the generative power of regular pattern grammars
- On infinite words obtained by selective substitution grammars
- Selective substitution array grammars
- Sequential, continuous and parallel grammars
- On coordinated selective substitutions: Towards a unified theory of grammars and machines
- Adding global forbidding context to context-free grammars
- Context-free like restrictions on selective rewriting
- Closure properties of selective substitution grammars part I
- Closure properties of selective substitution grammars
- Generalized forbidding grammars
Cited In (6)
- Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets
- Generalized one-sided forbidding grammars
- Generalized forbidding grammars
- One-sided random context grammars: a survey
- Fuzzy state grammar and fuzzy deep pushdown automaton
- Adding global forbidding context to context-free grammars
This page was built for publication: One-sided forbidding grammars and selective substitution grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903559)
