Test sets for morphisms with bounded delay

DOI10.1016/0166-218X(85)90063-0zbMath0579.68045MaRDI QIDQ1067414

Christian Choffrut, Juhani Karhumäki

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

deciphering delayEhrenfeucht Conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Reachability via Cooperating Morphisms ⋮ ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS ⋮ Equality sets of prefix morphisms and regular star languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• On binary equality sets and a solution to the test set conjecture in the binary case
• Test sets and checking words for homomorphism equivalence
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• On the decidability of homomorphism equivalence for languages
• Test sets for context free languages and algebraic systems of equations over a free monoid

This page was built for publication: Test sets for morphisms with bounded delay