A note on the avoidability of binary patterns with variables and reversals
Formal Languages and Automata Theory
2015-08-20 v1
Abstract
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular cases. We show that the results are not surprising at all in the general case, and extend the avoidability of these patterns to enforce aperiodic words.
Cite
@article{arxiv.1508.04571,
title = {A note on the avoidability of binary patterns with variables and reversals},
author = {Robert Mercaş},
journal= {arXiv preprint arXiv:1508.04571},
year = {2015}
}
Comments
This work is mostly obsolete as a week ago Currie and Lafrance fully characterised the patterns with reversals in [http://arxiv.org/abs/1508.02101]. The only novelty of this work is given by the aperiodicity restriction of the infinite words avoiding such patterns