The Morphisms With Unstackable Image Words
C. Robinson Tompkins

TL;DR
This paper explores the properties of overlap-free and square-free morphisms, introducing a new counterexample and generalizing key combinatorial properties to better classify these morphisms.
Contribution
It presents a counterexample to existing classifications and generalizes properties of the Leech square-free morphism for broader understanding.
Findings
Identified the Leech square-free morphism as a counterexample.
Generalized combinatorial properties of the Leech morphism.
Enhanced classification methods for overlap-free and square-free morphisms.
Abstract
In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the Leech square-free morphism to gain insights on a larger class of both overlap-free morphisms and square-free morphisms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Computability, Logic, AI Algorithms
