On the inherent ambiguity of simple tuple languages

DOI10.1007/BF02242346zbMath0221.68046OpenAlexW170876141MaRDI QIDQ2547492

Hermann Maurer, Werner Kuich

Publication date: 1971

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242346

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

Controlled pushdown automata, Rediscovering pushdown machines, Simple Matrix Grammars and Their Leftmost Variants, On the unambiguity of n-tuple languages, Classes of formal grammars

Cites Work

• A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
• On the entropy of context-free languages
• Unnamed Item