Descriptional complexity of semi-conditional grammars

DOI10.1016/J.IPL.2007.05.002MaRDI QIDQ2379990zbMATH OpenOpenAlexFDO

Authors Tomáš Masopust, Alexander Meduna

Publication date 24 March 2010

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

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

zbMATH Keywords

descriptional complexityformal languagessemi-conditional grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• New nonterminal complexity results for semi-conditional grammars
• Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
• scientific article; zbMATH DE number 1870506
• Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case
• Descriptional complexity of multi-parallel grammars

Cites work

• scientific article; zbMATH DE number 3913706 (Why is no real title available?)
• scientific article; zbMATH DE number 4064526 (Why is no real title available?)
• scientific article; zbMATH DE number 1870506 (Why is no real title available?)
• A variant of random context grammars: Semi-conditional grammars
• Grammars with Context Conditions and Their Applications
• On the descriptional complexity of some rewriting mechanisms regulated by context conditions

Cited in

(18)

• scientific article; zbMATH DE number 3990895 (Why is no real title available?)
• Simple-semi-conditional versions of matrix grammars with a reduced regulating mechanism
• Improved descriptional complexity results on generalized forbidding grammars
• scientific article; zbMATH DE number 4068327 (Why is no real title available?)
• A note on the descriptional complexity of semi-conditional grammars
• scientific article; zbMATH DE number 1870506 (Why is no real title available?)
• Generalized forbidding matrix grammars and their membrane computing perspective
• Descriptional complexity of matrix simple semi-conditional grammars
• Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case
• scientific article; zbMATH DE number 5506908 (Why is no real title available?)
• Descriptional complexity of multi-parallel grammars
• New nonterminal complexity results for semi-conditional grammars
• Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
• On the descriptional complexity of some rewriting mechanisms regulated by context conditions
• CONDITIONAL GRAMMARS WITH RESTRICTIONS BY SYNTACTIC PARAMETERS
• Descriptional complexity of context-free grammar forms
• A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
• Descriptional Complexity Of Generalized Forbidding Grammars

This page was built for publication: Descriptional complexity of semi-conditional grammars

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