On inherently ambiguous E0L languages
From MaRDI portal
Publication:796996
DOI10.1016/0304-3975(83)90071-3zbMath0544.68051OpenAlexW1992565783MaRDI QIDQ796996
R. Verraedt, Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90071-3
Related Items
EDT0L grammars with only one variable have tractable generating functions ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Cites Work