scientific article; zbMATH DE number 3876632

MaRDI QIDQ3341932zbMATH OpenFDO

Authors Juhani Karhumäki, Christian Choffrut

Publication date 1983

zbMATH Keywords

deciphering delayEhrenfeucht conjecture for morphismsmorphisms with bounded delay

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Test sets for morphisms with bounded delay
• 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

Cited in

(7)

• Inverse morphic equivalence on languages
• On test sets for checking morphism equivalence on languages with fair distribution of letters
• Test sets for morphisms with bounded delay
• scientific article; zbMATH DE number 3866597 (Why is no real title available?)
• scientific article; zbMATH DE number 176764 (Why is no real title available?)
• scientific article; zbMATH DE number 1929972 (Why is no real title available?)
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids

This page was built for publication:

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