From contextual grammars to range concatenation grammars

DOI10.1016/S1571-0661(05)82573-3zbMATH Open1263.68068MaRDI QIDQ4923554FDOQ4923554

Pierre Boullier

Publication date: 24 May 2013

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Counting with range concatenation grammars
• On computational complexity of contextual languages
• Title not available (Why is that?)
• A cubic time extensions of context-free grammars

Cited In (5)

• Logical Aspects of Computational Linguistics
• 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
• Grammar semantics, analysis and parsing by abstract interpretation
• Counting with range concatenation grammars

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)