We consider the following: Problems : Given two infinite words x and y, the subword equivalence problem is to decide whether they have the same finite factors, i.e. whether Fact(x) = Fact(y). The subword inclusion problem is to decide whether Fact(x) C Fact(y).
Jun 1, 2005 · The subword equivalence problem is the question whether two infinite words are subword equivalent. We show that, under mild hypotheses, the...
The subword equivalence problem is the question whether two infinite words are subword equivalent. We show that, under mild hypotheses, the decidability of ...
An infinite word x has bounded gaps if for any factor u of X, there exists an integer d such that, for any integer i, the word u has an occurrence in x[i, i+d).
Bibliographic details on On the Subword Equivalence Problem for Infinite Words.
An infinite word o is almost periodic iff for any finite subword x of it, w can be portioned in subwords of equal length, w = ~1~2.~3 . . ., such that each xi, ...
Missing: Equivalence | Show results with:Equivalence
Nov 7, 2020 · In this paper we are concerned with words over a finite alphabet Σ. We say a word y is a subword of a word w if there exist (possibly empty) ...
The subword equivalence problem is the question whether two infinite words are subword equivalent. We show that, under mild hypotheses, the decidability of ...
TL;DR: It is proved that the subword equivalence problem is decidable for two morphic words, provided the morphisms are primitive and have bounded delays ...
On the asymptotic abelian complexity of morphic words. The subword complexity of an infinite word counts the number of subwords of a given length, while the ...