论文信息 - Some combinatorial properties of factorial languages

Some combinatorial properties of factorial languages

A language L over a finite alphabet A is factorial if each factor (or subword) of any word of L still belongs to L. Typical examples of factorial languages are those formed by all finite factors of a given set of infinite words. In this case the language satisfies the important property that any word of L can be prolonged, in at least one direction, in the language.

A. Luca | S. Varricchio

[1] Andrzej Ehrenfeucht,et al. On the Subword Complexity of D0L Languages with a Constant Distribution , 1981, Inf. Process. Lett..

[2] Juhani Karhumäki,et al. On cube-free ω-words generated by binary morphisms , 1983, Discret. Appl. Math..

[3] C. Reutenauer,et al. On the burnside problem for semigroups , 1984 .

[4] F Blanchard,et al. Coded systems , 1986 .

[5] Dominique Perrin,et al. Une caractérisation des ensembles sofiques , 1986 .

[6] Aldo de Luca,et al. On the Factors of the Thue-Morse Word on Three Symbols , 1988, Inf. Process. Lett..

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

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

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

[10] Aldo de Luca,et al. Factorial Languages Whose Growth Function is Quadratically Upper Bounded , 1989, Inf. Process. Lett..

[11] Aldo de Luca,et al. A combinatorial theorem on p-power-free words and an application to semigroups , 1990, RAIRO Theor. Informatics Appl..