Abstract
Two infinite words x and y are said to be subword equivalent if they have the same set of finite subwords (factors). The subword equivalence problem is the question whether two infinite words are subword equivalent. We show that, under mild hypotheses, the decidability of the subword equivalence problem implies the decidability of the ω-sequence equivalence problem, a problem which has been shown to be decidable by Čulik and Harju for morphic words (i.e. words generated by iterating a morphism).
We prove that the subword equivalence problem is decidable for two morphic words, provided the morphisms are primitive and have bounded delays. We also prove that the subword equivalence problem is decidable for any pair of morphic words in the case of a binary alphabet. The subword equivalence problem is also shown to be decidable for two p-automatic words. We also prove a Cobham-like theorem: let p and q be two multiplicatively independent integers, and let x be a p-automatic word and let y be a q-automatic word, both with bounded gaps. If x and y are subword equivalent, then they are both ultimately periodic. Our results hold in fact for a stronger version, namely for the subword inclusion problem.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel and P. Séébold, A remark on morphic Sturmian words, Inform. Theor. Appl. 28, n∘ 3–4, (1994), p. 225–263.
A. Cobham, On the base-dependence of sets of numbers recognizable by finite automata, Math. Systems Theory 3 (1969), p. 186–192.
A. Cobham, Uniform tag sequences, Math. Systems Theory 6 (1972), p. 164–192.
K. Čulik II and I. Fris, The decidability of the equivalence problem for DOL-systems, Inform. Control 35 (1977), p. 20–39.
K. Čulik II and T. Harju, The ω-sequence equivalence problem for DOL-systems is decidable, J. Assoc. Comput. Mach., 31 (1984), p. 282–298.
A. Ehrenfeucht, J. Karhumaki and G. Rozenberg, On binary equality sets and a solution to the test set conjecture in the binary case, J. Algebra 85 (1983), p. 76–85.
A. Ehrenfeucht and G. Rozenberg, Repetition of subwords in DOL languages, Inform. and Control 59 (1983), p. 13–35.
I. Fagnot, Sur le problème de l'égalité des facteurs dans les mots morphiques, Technical report of L. I. T. P., 94/63, (1994).
I. Fagnot, Sur les facteurs des mots automatiques, Technical report of L. I. T. P., to appear.
H. Furstenberg, Recurrence in ergodic theory and combinatorial number theory, Princeton Universty Press, Princeton (1981).
G. Hansel, A propos d'un théorème de Cobham, in: Actes de la fête des mots, D. Perrin Ed., Greco de Programmation, CNRS, Rouen (1982)
T. Harju and M. Linna, On the periodicity of morphisms on free monoids, Inform. Theor Appl. 20, n∘ 1, (1986), p. 47–54.
B. Mossé, Puissance de mots et reconnaissabilité des points fixes d'une substitution, Theoret. Comput. Sci. 99 (1992), p. 327–334.
D. Perrin, Finite automata, dans Handbook of theoretical computer science, Vol. B, J. Van Leeuwen Ed., Elsevier, Amsterdam (1990), p. 1–57.
M. Queffelec, Substitution dynamical systems-Spectral analysis, Lecture Notes in Math. 1294 (1987), Springer-Verlag.
P. Séébold, An effective solution to the DOL periodicity problem in the binary case, EATCS Bull. 36 (1988), p. 137–151.
R. Villemaire, joining k-and l-recognizable sets of natural numbers, Proc. Stacs'92, Lecture notes in Comput. Sci. 577 (1992), p. 83–94.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fagnot, I. (1995). On the subword equivalence problem for infinite words. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_66
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive