Descriptional Complexity Of Generalized Forbidding Grammars

DOI10.1080/00207160304666MaRDI QIDQ4796491zbMATH OpenOpenAlexFDO

Authors Alexander Meduna, Martin Švec

Publication date 5 March 2003

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

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

zbMATH Keywords

forbidding grammarsenumerable language

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Improved descriptional complexity results on generalized forbidding grammars
• Descriptional complexity of multi-parallel grammars
• Descriptional complexity of semi-conditional grammars
• Generalized forbidding grammars
• On the descriptional complexity of scattered context grammars

Cites work

• scientific article; zbMATH DE number 1502102 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Generalized forbidding grammars
• Homogeneous grammars with a reduced number of non-context-free products

Cited in

(10)

• scientific article; zbMATH DE number 2050924 (Why is no real title available?)
• Improved descriptional complexity results on generalized forbidding grammars
• scientific article; zbMATH DE number 4068327 (Why is no real title available?)
• Generalized forbidding matrix grammars and their membrane computing perspective
• 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
• Generalized forbidding grammars
• On the computational completeness of generalized forbidding matrix grammars

This page was built for publication: Descriptional Complexity Of Generalized Forbidding Grammars

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