Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Becker, Joey"'
Publikováno v:
EPTCS 252, 2017, pp. 26-40
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether or not a gi
Externí odkaz:
http://arxiv.org/abs/1708.06459
