Generalized forbidding grammars

DOI10.1080/00207169008803908zbMath0701.68070MaRDI 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 rewriting; formal language theory; forbidding grammars

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q42: Grammars and rewriting systems

Related Items

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

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