An undecidable problem for context-free grammars

DOI10.1016/0020-0190(85)90081-XzbMath0581.68056MaRDI QIDQ1067789

Erkki Maekinen

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

undecidabilityambiguityleft Szilard language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Efficient coding of formalized messages

Cites Work

• Some decidability results about regular and pushdown translations
• The theory of languages
• Associate languages and derivational complexity of formal grammars and languages
• Unnamed Item