A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language

DOI10.1145/321510.321517zbMath0182.33401OpenAlexW2087904762MaRDI QIDQ5572337

Hermann Maurer

Publication date: 1969

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

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

zbMATH Keywords

languages, automata, networks

Related Items

Algebraic dynamic programming for multiple context-free grammars, Ambiguity in omega context free languages, A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct, Tree controlled grammars, On the inherent ambiguity of simple tuple languages, Theory of formal grammars, Synchronized EOL forms