论文信息 - Palindromes in the Fibonacci Word

Palindromes in the Fibonacci Word

The present paper is devoted to the proof of a new property of the Fibonacci word F, namely the characterization of all the palindromes that occur in F. This property is also important because palindromes are objects of great interest in computer science

Xavier Droubay | Xavier Droubay

[1] R. Baer,et al. The Significance of the System of Subgroups for the Structure of the Group , 1939 .

[2] Aldo de Luca,et al. A Combinatorial Property of the Fibonacci Words , 1981, Inf. Process. Lett..

[3] Tom C. Brown,et al. Descriptions of the Characteristic Sequence of an Irrational , 1993, Canadian Mathematical Bulletin.

[4] P. Shiue,et al. Substitution invariant cutting sequences , 1993 .

[5] Filippo Mignosi,et al. Morphismes sturmiens et règles de Rauzy , 1993 .

[6] Jean-Pierre Borel,et al. Quelques mots sur la droite projective réelle , 1993 .

[7] Karel Culik,et al. Iterative Devices Generating Infinite Words , 1992, STACS.

[8] Filippo Mignosi,et al. Some Combinatorial Properties of Sturmian Words , 1994, Theor. Comput. Sci..

[9] Jean Berstel,et al. A Characterization of Sturmian Morphisms , 1993, MFCS.

[10] Zhi-Xiong Wen,et al. LOCAL ISOMORPHISMS OF INVERTIBLE SUBSTITUTIONS , 1994 .

[11] Zhi-Xiong Wen,et al. Some Properties of the Singular Words of the Fibonacci Word , 1994, Eur. J. Comb..

[12] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .

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