A note on the descriptional complexity of semi-conditional grammars

DOI10.1016/j.ipl.2009.10.002zbMath1206.68180OpenAlexW2086303683MaRDI QIDQ990095

Fumiya Okubo

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.10.002

zbMATH Keywords

formal languagesdescriptional complexitysemi-conditional grammarssimple semi-conditional grammars

Mathematics Subject Classification ID

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

Related Items

Nonterminal complexity of one-sided random context grammars ⋮ Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ On the computational completeness of matrix simple semi-conditional grammars

Cites Work

• Unnamed Item
• Unnamed Item
• A variant of random context grammars: Semi-conditional grammars
• On the descriptional complexity of some rewriting mechanisms regulated by context conditions
• Descriptional complexity of semi-conditional grammars
• A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
• Normal forms for phrase-structure grammars
• Grammars with Context Conditions and Their Applications

This page was built for publication: A note on the descriptional complexity of semi-conditional grammars