A polynomial time extension of parallel multiple context-free grammar

DOI10.1007/11422532_12MaRDI QIDQ5706929zbMATH OpenOpenAlexFDO

Authors Peter Ljunglöf

Publication date 23 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136076

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A parallel parsing algorithm for arbitrary context-free grammars
• On the complexity of parallel parsing of general context-free languages
• scientific article; zbMATH DE number 4119661
• scientific article; zbMATH DE number 5271
• scientific article; zbMATH DE number 975704
• scientific article; zbMATH DE number 4121469
• Descriptional complexity of multi-parallel grammars
• Efficient parallel and incremental parsing of practical context-free languages
• scientific article; zbMATH DE number 2050924
• On the computational completeness of context-free parallel communicating grammar systems

Cited in

(7)

• Grouped partial ET0L systems and parallel multiple context-free grammars
• IDL-PMCFG, a grammar formalism for describing free word order languages
• GIGs: Restricted context-sensitive descriptive power in bounded polynomial-time
• scientific article; zbMATH DE number 4121469 (Why is no real title available?)
• Distributional learning of parallel multiple context-free grammars
• An Algebraic Approach to Multiple Context-Free Grammars
• A cubic time extensions of context-free grammars

This page was built for publication: A polynomial time extension of parallel multiple context-free grammar

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