Preservation of unambiguity and inherent ambiguity in context-free languages

DOI10.1145/321341.321345zbMath0143.01603OpenAlexW2031897634WikidataQ129991799 ScholiaQ129991799MaRDI QIDQ5518369

Seymour Ginsburg, Joseph S. Ullian

Publication date: 1966

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321341.321345

zbMATH Keywords

mathematical logic

Related Items (11)

The theory of languages ⋮ The theory of languages ⋮ A quasi-polynomial-time algorithm for sampling words from a context-free language ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ The hardest language for grammars with context operators ⋮ Non-closure under complementation for unambiguous linear grammars ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ Structure des grammaires d'ambiguite bornee ⋮ On the unambiguity of n-tuple languages ⋮ BOOLEAN GRAMMARS AND GSM MAPPINGS ⋮ HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES

This page was built for publication: Preservation of unambiguity and inherent ambiguity in context-free languages