On the aperiodic avoidability of binary patterns with variables and reversals
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.
Funding
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.
History
School
- Science
Department
- Computer Science
Published in
Theoretical Computer ScienceCitation
MERCAS, R., 2016. On the aperiodic avoidability of binary patterns with variables and reversals. Theoretical Computer Science, 682, pp. 180–189.Publisher
© ElsevierVersion
- AM (Accepted Manuscript)
Publisher statement
This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/Acceptance date
2016-12-19Publication date
2016-12-30Notes
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.022ISSN
0304-3975Publisher version
Language
- en
