Hostname: page-component-cc8bf7c57-77pjf Total loading time: 0 Render date: 2024-12-10T02:18:50.274Z Has data issue: false hasContentIssue false
  • English
  • Français

Periodicity Problem of Substitutions over TernaryAlphabets

Published online by Cambridge University Press:  04 January 2008

Bo Tan  and
Zhi-Ying Wen
Bo Tan
Affiliation:
Department of Mathematics, Huazhong University of Science and Technology, Wuhan 430074, P.R. China; bo_tan@163.com
Zhi-Ying Wen
Affiliation:
Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P.R. China; wenzy@tsinghua.edu.cn
Get access

Abstract

In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.

Keywords

Periodicitysubstitution.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 4: Fibonacci words , October 2008 , pp. 747 - 762
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Fine, N.J. and Wilf, H.S., Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc. 16 (1965) 109–114. CrossRef
Harju, T. and Linna, M., On the periodicity of morphisms on free monoids. RAIRO-Theor. Inf. Appl. 20 (1986) 47–54. CrossRef
Head, T., Fixed languages and the adult language of 0L schemes. Int. J. Comput. Math. 10 (1981) 103–107. CrossRef
Lando, B., Periodicity and ultimate periodicity of D0L systems. Theor. Comput. Sci. 82 (1991) 19–33. CrossRef
M. Lothaire, Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley (1983).
Pansiot, J., Decidability of periodicity for infinite words. RAIRO-Theor. Inf. Appl. 20 (1986) 43–46. CrossRef
G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems. Academic Press, New York (1980).
Séébold, P., An effective solution to the D0L periodicity problem in the binary case. EATCS Bull. 36 (1988) 137–151.