Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952044 | Theoretical Computer Science | 2017 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Robert MercaÅ,