Descriptional complexity of multi-parallel grammars

DOI10.1016/J.IPL.2008.04.002zbMATH Open1191.68366OpenAlexW2053196675MaRDI QIDQ975402FDOQ975402

Tomáš Masopust

Publication date: 9 June 2010

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

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

Recommendations

• scientific article; zbMATH DE number 2050924
• scientific article
• Descriptional complexity of semi-conditional grammars
• scientific article; zbMATH DE number 1355184
• scientific article; zbMATH DE number 1836409

zbMATH Keywords

descriptional complexityformal languagesmulti-parallel grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Normal forms for phrase-structure grammars
• Grammars with Context Conditions and Their Applications
• Descriptional complexity of semi-conditional grammars
• Title not available (Why is that?)
• Multi grammars

Cited In (14)

• Logical Aspects of Computational Linguistics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Nonterminal complexity of one-sided random context grammars
• Nonterminal complexity of tree controlled grammars
• Title not available (Why is that?)
• Descriptional complexity of context-free grammar forms
• Descriptional Complexity Of Generalized Forbidding Grammars
• Title not available (Why is that?)
• Grouped partial ET0L systems and parallel multiple context-free grammars
• Title not available (Why is that?)

This page was built for publication: Descriptional complexity of multi-parallel grammars

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