Generalized one-sided forbidding grammars
From MaRDI portal
Publication:2868164
DOI10.1080/00207160.2012.723703zbMath1278.68125OpenAlexW2084555465MaRDI QIDQ2868164
Publication date: 23 December 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.723703
formal languagesregulated rewritinggenerative powerlanguage familiesgeneralized one-sided forbidding grammars
Related Items (3)
Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets ⋮ One-Sided Random Context Grammars: A Survey ⋮ Fuzzy state grammar and fuzzy deep pushdown automaton
Cites Work
- Unnamed Item
- One-sided random context grammars
- ETOL-grammars and N-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
- One-sided and two-sided context in formal grammars
- Descriptional Complexity Of Generalized Forbidding Grammars
- One-sided forbidding grammars and selective substitution grammars
- Grammars with Context Conditions and Their Applications
This page was built for publication: Generalized one-sided forbidding grammars