scientific article; zbMATH DE number 5506908

MaRDI QIDQ3601874zbMATH OpenFDO

Authors Tomáš Masopust, Alexander Meduna

Publication date 12 February 2009

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Descriptional complexity of multi-parallel grammars
• scientific article; zbMATH DE number 2050924
• scientific article; zbMATH DE number 1355184
• Descriptional complexity of semi-conditional grammars
• scientific article; zbMATH DE number 1998334
• scientific article; zbMATH DE number 97565
• Descriptional complexity of context-free grammar forms
• scientific article; zbMATH DE number 878943
• On the complexity of parallel parsing of general context-free languages
• On the computational completeness of context-free parallel communicating grammar systems

Cited in

(9)

• Nonterminal complexity of one-sided random context grammars
• scientific article; zbMATH DE number 1355184 (Why is no real title available?)
• scientific article; zbMATH DE number 1998334 (Why is no real title available?)
• scientific article; zbMATH DE number 2050924 (Why is no real title available?)
• scientific article; zbMATH DE number 2068880 (Why is no real title available?)
• Descriptional complexity of three-nonterminal scattered context grammars: an improvement
• Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
• Improved descriptional complexity results on generalized forbidding grammars
• Descriptional complexity of multi-parallel grammars

This page was built for publication:

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