From contextual grammars to range concatenation grammars

DOI10.1016/S1571-0661(05)82573-3MaRDI QIDQ4923554zbMATH OpenFDO

Authors Pierre Boullier

Publication date 24 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(05)82573-3

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Recommendations

• Counting with range concatenation grammars
• Parsing beyond context-free grammars
• On computational complexity of contextual languages
• A cubic time extensions of context-free grammars
• scientific article; zbMATH DE number 1183241

Cites work

• A cubic time extensions of context-free grammars
• Counting with range concatenation grammars
• scientific article; zbMATH DE number 1101389 (Why is no real title available?)
• scientific article; zbMATH DE number 3307580 (Why is no real title available?)
• On computational complexity of contextual languages

Cited in

(5)

• Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
• Studies on the rules of \(\beta\)-strand alignment in a protein \(\beta\)-sheet structure
• Counting with range concatenation grammars
• Logical Aspects of Computational Linguistics
• Grammar semantics, analysis and parsing by abstract interpretation

This page was built for publication: From contextual grammars to range concatenation grammars

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