The Morphisms With Unstackable Image Words
Formal Languages and Automata Theory
2010-06-08 v1
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.
Keywords
Cite
@article{arxiv.1006.1273,
title = {The Morphisms With Unstackable Image Words},
author = {C. Robinson Tompkins},
journal= {arXiv preprint arXiv:1006.1273},
year = {2010}
}
Comments
8 pages, 6 figures