Back to Search
Start Over
New results on pseudosquare avoidance
- Publication Year :
- 2019
- Publisher :
- arXiv, 2019.
-
Abstract
- We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \overline{x}$), and we completely classify which possibilities can occur. We consider avoiding $x p(x)$, where $p$ is any permutation of the underlying alphabet, and $x t(x)$, where $t$ is any transformation of the underlying alphabet. Finally, we prove the existence of an infinite binary word simultaneously avoiding all occurrences of $x h(x)$ for every nonerasing morphism $h$ and all sufficiently large words $x$.
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....08e0e1bd9bb86e03045ee4ae4cb7303e
- Full Text :
- https://doi.org/10.48550/arxiv.1904.09157