Test sets for morphisms with bounded delay

DOI10.1016/0166-218X(85)90063-0MaRDI QIDQ1067414zbMATH OpenFDO

Authors Christian Choffrut, Juhani Karhumäki

Publication date 1985

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

Full work available at URL https://doi.org/10.1016/0166-218X(85)90063-0

zbMATH Keywords

deciphering delayEhrenfeucht Conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3876632
• scientific article; zbMATH DE number 3866597
• scientific article; zbMATH DE number 4045192
• On test sets for checking morphism equivalence on languages with fair distribution of letters
• scientific article; zbMATH DE number 3883627

Cites work

• scientific article; zbMATH DE number 3866597 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3710436 (Why is no real title available?)
• scientific article; zbMATH DE number 3767067 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3332047 (Why is no real title available?)
• On binary equality sets and a solution to the test set conjecture in the binary case
• On the decidability of homomorphism equivalence for languages
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• Test sets and checking words for homomorphism equivalence
• Test sets for context free languages and algebraic systems of equations over a free monoid
• The (generalized) Post correspondence problem with lists consisting of two words is decidable

Cited in

(5)

• Equality sets of prefix morphisms and regular star languages
• scientific article; zbMATH DE number 3876632 (Why is no real title available?)
• ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS
• scientific article; zbMATH DE number 1929972 (Why is no real title available?)
• Reachability via cooperating morphisms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067414)