论文信息 - On Some Factorizations of Infinite Words by Elements of Codes

On Some Factorizations of Infinite Words by Elements of Codes

Abstract We show that an infinite word s satisfies s = u0u1u2… with all ui being different nonempty words and their set being a biprefix code if and only if s is not ultimately periodic. We give also related results, considering in particular arbitrary codes, infix codes and the case of two-sided infinite words.

Giuseppe Pirillo | Jacques Justin | G. Pirillo | J. Justin

[1] Giuseppe Pirillo. Infinite Words and Biprefix Codes , 1994, Inf. Process. Lett..

[2] Guy Melançon. Viennot Factorization of Infinite Words , 1996, Inf. Process. Lett..

[3] M. Lothaire. Combinatorics on words: Bibliography , 1997 .

[4] Xavier Droubay,et al. Palindromes in the Fibonacci Word , 1995, Inf. Process. Lett..

[5] Jacques Justin,et al. Shirshov's theorem and ω-permutability of semigroups , 1991 .

[6] Giuseppe Pirillo,et al. Factorial Languages and some Combinatorial Properties of Semigroups , 1993, Int. J. Algebra Comput..

[7] Aldo de Luca. A Division Property of the Fibonacci Word , 1995, Inf. Process. Lett..

[8] Masami Ito,et al. Outfix and Infix Codes and Related Classes of Languages , 1991, J. Comput. Syst. Sci..

[9] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .

[10] Stefano Varricchio. Factorizations of Free Monoids and Unaviodable Regularities , 1990, Theor. Comput. Sci..

[11] J. Berstel,et al. Theory of codes , 1985 .