On the unambiguity of n-tuple languages

DOI10.1007/BF02252838zbMath0308.68065OpenAlexW375849103MaRDI QIDQ1218730

N. Hojka

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• On the inherent ambiguity of simple tuple languages
• Preservation of unambiguity and inherent ambiguity in context-free languages

This page was built for publication: On the unambiguity of n-tuple languages