No CrossRef data available.
Article contents
Periodicity Problem of Substitutions over TernaryAlphabets
Published online by Cambridge University Press: 04 January 2008
Abstract
In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.
Keywords
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 4: Fibonacci words , October 2008 , pp. 747 - 762
- Copyright
- © EDP Sciences, 2008
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.