Generalized forbidding grammars

DOI10.1080/00207169008803908zbMath0701.68070OpenAlexW2068931825MaRDI QIDQ3479537

Alexander Meduna

Publication date: 1990

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

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

zbMATH Keywords

regulated rewritingformal language theoryforbidding grammars

Mathematics Subject Classification ID

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

Related Items (12)

Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets ⋮ Prefix pushdown automata and their simplification ⋮ Middle quotients of linear languages ⋮ Descriptional Complexity Of Generalized Forbidding Grammars ⋮ On grammars with local and global context conditions ⋮ Forbidding ET0L grammars. ⋮ One-sided forbidding grammars and selective substitution grammars ⋮ On the computational completeness of generalized forbidding matrix grammars ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ Generalized forbidding matrix grammars and their membrane computing perspective ⋮ Generalized one-sided forbidding grammars ⋮ Fuzzy state grammar and fuzzy deep pushdown automaton

Cites Work

• A variant of random context grammars: Semi-conditional grammars
• ETOL-grammars and N-grammars
• Sequential, continuous and parallel grammars
• Maps preserving the uniformity of neighborhood interconnection patterns in tessellation structures

This page was built for publication: Generalized forbidding grammars