Dominoes over a free monoid

DOI10.1016/0304-3975(82)90070-6zbMath0509.68068OpenAlexW2013790542MaRDI QIDQ1838319

Karel II Culik, Tero J.Harju

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90070-6

zbMATH Keywords

decidability problemsquotient alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

The finest homophonic partition and related code concepts ⋮ Splicing semigroups of dominoes and DNA

Cites Work

• Unnamed Item
• Unnamed Item
• Every two equivalent DOL systems have a regular true envelope
• On the decidability of homomorphism equivalence for languages
• Some decidability results about regular and pushdown translations
• The decidability of the equivalence problem for DOL-systems

This page was built for publication: Dominoes over a free monoid