Sublogarithmic ambiguity
From MaRDI portal
Publication:2575762
DOI10.1016/j.tcs.2005.07.024zbMath1079.68056OpenAlexW2914942097MaRDI QIDQ2575762
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
Related Items (3)
Cites Work
- Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
- Reversal-bounded multipushdown machines
- On the number of occurrences of a symbol in words of regular languages.
- Optimization of LR(k) parsers
- Mathematical Foundations of Computer Science 2004
- On Context-Free Languages
- One-way stack automata
- A helpful result for proving inherent ambiguity
- Some inherently ambiguous context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sublogarithmic ambiguity