Generalized forbidding grammars

DOI10.1080/00207169008803908zbMATH Open0701.68070OpenAlexW2068931825MaRDI QIDQ3479537FDOQ3479537

Authors: 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

Recommendations

• Generalized one-sided forbidding grammars
• Descriptional Complexity Of Generalized Forbidding Grammars
• Improved descriptional complexity results on generalized forbidding grammars
• Improved descriptional complexity results on generalized forbidding grammars
• scientific article; zbMATH DE number 1560210
• Generalized forbidding matrix grammars and their membrane computing perspective
• One-sided forbidding grammars and selective substitution grammars
• Adding global forbidding context to context-free grammars
• Formal grammars for turn-bounded deterministic context-free languages
• Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems

zbMATH Keywords

regulated rewritingformal language theoryforbidding grammars

Mathematics Subject Classification ID

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

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

Cited In (16)

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

This page was built for publication: Generalized forbidding grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479537)