Descriptional complexity of multi-parallel grammars

DOI10.1016/j.ipl.2008.04.002zbMath1191.68366OpenAlexW2053196675MaRDI QIDQ975402

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

zbMATH Keywords

formal languagesdescriptional complexitymulti-parallel grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Nonterminal complexity of one-sided random context grammars ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Nonterminal complexity of tree controlled grammars ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity

Cites Work

• Unnamed Item
• Descriptional complexity of semi-conditional grammars
• Normal forms for phrase-structure grammars
• Multi grammars
• Grammars with Context Conditions and Their Applications