MERCAS, R., 2016. On the aperiodic avoidability of binary patterns with variables and reversals. Theoretical Computer Science, 682, pp. 180–189.
In this work we present a characterisation of the avoidability of all unary and binary patterns, that do not only contain variables but also reversals of their instances, with respect to aperiodic infinite words. These types of patterns were studied recently in either more general or particular cases.
This paper was accepted for publication in the journal Theoretical Computer Science and the definitive published version is available at http://dx.doi.org/10.1016/j.tcs.2016.12.022
Work partially supported by the P.R.I.M.E. programme of DAAD co-funded by BMBF and EU’s 7th Framework Programme (grant 605728) and by the
Newton International Fellowship with funds from the Royal Society and the British Academy.