Descriptional Complexity Of Generalized Forbidding Grammars

DOI10.1080/00207160304666zbMath1009.68065OpenAlexW2165405772MaRDI QIDQ4796491

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)

Related Items (5)

Forbidding ET0L 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

Cites Work

• Homogeneous grammars with a reduced number of non-context-free products
• Generalized forbidding grammars
• Unnamed Item
• Unnamed Item

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