Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M.P.Beal and D. Perrin, Une caracterisation des ensembles sofiques, C.R. Acad.Sci.Paris, 1986.
J. Berstel, Mots de Fibonacci, Séminaire d–Informatique Théorique,L.I.T.P. Université Paris VI et VII, Année 1980/81,pp.57–78.
F. Blanchard and G. Hansel, Systèmes codes, Theoretical Computer Science, 44, (1986) 17–49.
A. de Luca and S. Varricchio, A combinatorial theorem on p-power-free words and an application to semigroups, (Abstract 1987 in the J. of Abstracts of AMS). R.A. I. R.O., I.T. (to appear).
A. de Luca and S. Varricchio, Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups, Theoretical Computer Science,(to appear).
A. de Luca and S. Varricchio, On the factors of the Thue-Morse word on three symbols, Information Processing Letters, 27 (1988) 281–285.
A. de Luca and S.Varricchio, Factorial Languages whose growth function is quadratically upper bounded, Information Processing Letters, (to appear).
E.Ehrenfeucht and G.Rozenberg,On the subword complexity od DOL languages with a constant distribution, Information Processing Letters,13 (1981)108–113.
J.Karhumaki, On cube-free ω-words generated by binary morphisms, Discrete applied Mathematics, 5 (1983) 279–297.
M. Lothaire, Combinatorics on words, Addison Wesley, Reading, MA, 1983.
A. Machi, private communication.
F. Mignosi, Infinite words with linear subword complexity, preprint, 1988.
A.Restivo and C. Reutenauer, On the Burnside problem for semigroups, J. of Algebra, 89(1984) 102– 104.
A.Restivo, Permutation properties and the Fibonacci semigroup, Semigroup Forum,(to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this paper
Cite this paper
de Luca, A., Varricchio, S. (1990). Some Combinatorial Properties of Factorial Languages. In: Capocelli, R.M. (eds) Sequences. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3352-7_20
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3352-7_20
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7977-8
Online ISBN: 978-1-4612-3352-7
eBook Packages: Springer Book Archive