Finite test-sets for overlap-free morphisms

DOI10.1007/3-540-45687-2_50MaRDI QIDQ4708607zbMATH OpenFDO

Authors Gwénaël Richomme, Francis Wlazinski

Publication date 18 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200605.htm

zbMATH Keywords

combinatorics on wordsmorphismsoverlap-free wordstest-sets

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Overlap-free morphisms and finite test-sets
• Characterization of test-sets for overlap-free morphisms
• A characterization of overlap-free morphisms
• Existence of finite test-sets for k-power-freeness of uniform morphisms
• A test-set fork-power-free binary morphisms
• Test sets for morphisms with bounded delay
• scientific article; zbMATH DE number 3876632
• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• Test sets for finite substitutions
• Finite test sets for morphisms that are squarefree on some of Thue's squarefree ternary words

Cited in

(9)

• A characterization of overlap-free morphisms
• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• Overlap-free morphisms and finite test-sets
• Characterization of test-sets for overlap-free morphisms
• A test-set fork-power-free binary morphisms
• scientific article; zbMATH DE number 3898261 (Why is no real title available?)
• scientific article; zbMATH DE number 3912632 (Why is no real title available?)
• scientific article; zbMATH DE number 2068881 (Why is no real title available?)
• About cube-free morphisms (extended abstract)

This page was built for publication: Finite test-sets for overlap-free morphisms

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