Some inherently ambiguous context-free languages

DOI10.1016/S0019-9958(71)90455-4zbMATH Open0227.68039OpenAlexW2053134413MaRDI QIDQ5634865FDOQ5634865

Authors: Eliahu Shamir 

Publication date: 1971

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(71)90455-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• Classes of formal grammars
• Analytic models and ambiguity of context-free languages
• Sublogarithmic ambiguity
• Algebraic dynamic programming for multiple context-free grammars
• Fast uniform analysis of Coupled-Context-Free languages
• Structure des grammaires d'ambiguite bornee
• On parsing coupled-context-free languages
• Title not available (Why is that?)

This page was built for publication: Some inherently ambiguous context-free languages

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