论文信息 - On a Combinatorial Property of Sturmian Words

On a Combinatorial Property of Sturmian Words

Recall that a semigroup has the property Pn∗ if for any sequence of n of its elements, two differently permuted products of these n elements are equal. Let s be an infinite Sturmian word (on a 2-letter alphabet A). We prove that the Rees quotient of A∗ by the set of the non-factors of s has P4∗ and that this result is the best possible. We prove also that if St is the set of all finite Sturmian words, then the Rees quotient A∗(A∗ − St) has P8∗.

Giuseppe Pirillo | Jacques Justin

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

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

[3] Aldo de Luca,et al. Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups , 1989, Theor. Comput. Sci..

[4] Filippo Mignosi,et al. Infinite Words with Linear Subword Complexity , 1989, Theor. Comput. Sci..

[5] Jean Berstel,et al. A Geometric Proof of the Enumeration Formula for Sturmian Words , 1993, Int. J. Algebra Comput..

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

[7] Patrice Séébold,et al. Fibonacci Morphisms and Sturmian Words , 1991, Theor. Comput. Sci..

[8] Jacques Justin,et al. Infinite words and permutation properties , 1990 .

[9] Giuseppe Pirillo. On a combinatorial property of Fibonacci semigroup , 1993, Discret. Math..

[10] S. Dulucq,et al. On the factors of the Sturmian sequences , 1990 .

[11] Filippo Mignosi,et al. On the Number of Factors of Sturmian Words , 1991, Theor. Comput. Sci..

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

[13] Antonio Restivo. Permutation properties and the fibonacci semigroup , 1989 .

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