Sublogarithmic ambiguity
From MaRDI portal
Publication:2575762
DOI10.1016/J.TCS.2005.07.024zbMATH Open1079.68056OpenAlexW2914942097MaRDI QIDQ2575762FDOQ2575762
Publication date: 6 December 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.024
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reversal-bounded multipushdown machines
- Title not available (Why is that?)
- On Context-Free Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization of LR(k) parsers
- Some inherently ambiguous context-free languages
- One-way stack automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of occurrences of a symbol in words of regular languages.
- Title not available (Why is that?)
- A helpful result for proving inherent ambiguity
- Exponential ambiguity of context-free grammars
- Title not available (Why is that?)
- Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2004
Cited In (10)
- Mathematical Foundations of Computer Science 2004
- Unambiguous Boolean grammars
- Title not available (Why is that?)
- Analytic models and ambiguity of context-free languages
- On differentiation functions, structure functions, and related languages of context-free grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- In memoriam Chandra Kintala
- Exponential ambiguity of context-free grammars
- Title not available (Why is that?)
This page was built for publication: Sublogarithmic ambiguity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575762)
