Abstract
A word is called kth power-free if none of its non-empty factors have the form uk. A morphism is a kth power-free morphism it is preserves the kth power-free words. We present some conditions for some particular morphisms to be kth power-free. As a matter of fact we claim that the framework of the theory of codes is a good framework for these problems and we try to illustrate this.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
D. Bean, A. Ehrenfeucht, G. McNulty, Avoidable patterns in strings of symbols, Pacific J. of Math. 85, 2 (1979) 261–294.
J. Berstel, Sur les mots sans carré définis par morphisme, 6th ICALP Symposium, Maurer ed. Lecture Notes in Computer Sciences, 71, Springer (1979) 16–25.
J. Berstel, Some recent results on squarefree words,( STACCS' 84 ) Technical Report LITP 84–6.
J. Berstel, D. Perrin, J.F. Perrot, A. Restivo, Sur le théorème du défault, Journal of algebra Vol 60 1(1979)169–180.
J.Berstel, D.Perrin, M.P. Schutzemberger, The theory of codes Acad. Press. (1984).
F.J. Brandenburg, Uniformly growing kth power-free homomorphisms, Theor. Comp. Science 23 ( 1983) 69–82.
M. Crochemore, Sharp characterizations of square-free morphisms, Theo. Comp. Science 18(1982)221–226.
M. Crochemore, Tests sur les morphismes faiblement sans carré, Proceedings of the combinatorics on words, Cuming ed. Waterloo, Canada 1982.
A. Ehrenfeucht, G.Rozenberg, Repetitions in homomorphisms and languages, 9th ICALP Symposium Lectures Notes in Comp. Sc. Springer (1982)192–196.
S.W. Golomb, B. Gordon, L.R. Welch, Comma-free codes, Can. J. Mat. 10(1958)202–209.
T. Harju, Morphisms that avoid overlapping, University of Turku, May 1983.
G. Hedlund, Remarks on the work of Axel Thue on sentences, Nord. Mat. Tidskr. 16(1967).
J. Karhumaki, On cubic-free w-words generated by binary morphisms, Discrete applied Math. 5(1983)279–297.
M. Leconte, A characterization of power-free morphisms, Technical report LITP 84–65, To appear in Theor. Comp. Sc. 1985.
Lothaire, Combinatorics on words, Addison Wesley, Reading, Mass. 1982.
J.E. Pin, Variétés de langages formels (Dunod, Paris 1984).
A. Restivo, Codes and aperiodic languages, I. Fachtagunguber Automatentheoric und Formale Sprachen, Lect. Notes in Comp. Sc. 2 Springer 1973,175–181.
A. Restivo, A combinatorial property of codes having finite synchronisation delay, Theo. Comp. Sc. 1(1975)95–101.
P. Seebold, Morphismes itérés, mot de Morse et mot de Fibonacci, C.R. Acad. Sci. Paris, T 295(1982)439–441.
J.C. Spehner, Quelques constructions et algorithmes relatifs aux sous-monoides d'un monoide libre. Semigroup Forum 9(1975)1–22.
A. Thue, Uber die gegenseitige lage gleichter teile gewisser zeichenreihen, Norske, Vid. Selsk. Skr. Mat. Nat. Kl Christiana 1(1912)1–67.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leconte, M. (1985). Kth power-free codes. In: Nivat, M., Perrin, D. (eds) Automata on Infinite Words. LITP 1984. Lecture Notes in Computer Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15641-0_33
Download citation
DOI: https://doi.org/10.1007/3-540-15641-0_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15641-3
Online ISBN: 978-3-540-39505-8
eBook Packages: Springer Book Archive