Palindrome complexity

Theoretical Computer Science

Volumn 292, Issue 1, 2003, Pages 9-31

  Allouche, Jean Paul ^a   Baake, Michael ^b   Cassaigne, Julien ^c   Damanik, David ^d  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITY OF GREIFSWALD   (Germany)

^c CNRS   (France)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE;

PALINDROME COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0037427734     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00212-2     Document Type: Article

References (48)

1. Alessandri P., Berthé V. Three distance theorems and combinatorics on words. Enseign. Math. 44:1998;103-132.
2. Allouche J.-P. The number of factors in a paperfolding sequence. Bull. Austral. Math. Soc. 46:1992;23-32.
3. Allouche J.-P. Sur la complexité des suites infinies. Bull. Belg. Math. Soc. (1):1994;133-143.
4. Allouche J.-P. Schrödinger operators with Rudin-Shapiro potentials are not palindromic. J. Math. Phys. (Special Issue "Quantum Problems in Condensed Matter Physics"). 38:1997;1843-1848.
5. Allouche J.-P. M. Bousquet-Mélou, Facteurs des suites de Rudin-Shapiro généralisées. Bull. Belg. Math. Soc. 1:1994;145-164.
6. Allouche J.-P., Liardet P. Generalized Rudin-Shapiro sequences. Acta Arith. 60:1991;1-27.
7. Allouche J.-P., Shallit J. The ring of. k -regular sequences Theoret. Comput. Sci. 98:1992;163-187.
8. Allouche J.-P., Shallit J. Sums of digits, overlaps, and palindromes. Discrete Math. Theoret. Comput. Sci. 4:2000;1-10. http://dmtcs.loria.fr/volumes/abstracts/dm040101.abs.html.
9. J.-P. Allouche, J. Shallit, The ring of k -regular sequences, II, submitted, 2002.
10. M. Baake, A note on palindromicity, Lett. Math. Phys. 49 (1999) 217-227; math-ph/9907011.
11. Berstel J. Recent results in Sturmian words. Dassow J., Rozenberg G., Salomaa A. Developments in Language Theory II. 1996;13-24 World Scientific, Singapore.
12. J. Berstel, P. Séébold, Sturmian words, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Cambridge Univ. Press, 2002, Chapter 3, preprint version available at: http://www-igm.univ-mlv.fr/∼berstel/Lothaire/index.html.
13. V. Berthé, L. Vuillon, Palindromes and two-dimensional Sturmian sequences, J. Automat. Lang. Combin. to appear.
14. Cassaigne J. Special factors of sequences with linear subword complexity. Dassow J., Rozenberg G., Salomaa A. Developments in Language Theory, II. 1996;25-34 World Scientific, Singapore.
15. Cassaigne J. Complexité et facteurs spéciaux. Bull. Belg. Math. Soc. 4:1997;67-88.
16. C. Choffrut, private communication, January 2001.
17. Cobham A. Uniform tag sequences. Math. Systems Theory. 6:1972;164-192.
18. Coven E.M., Hedlund G.A. Sequences with minimal block growth. Math. Systems Theory. 7:1973;138-153.
19. Damanik D. Local symmetries in the period-doubling sequence. Discrete Appl. Math. 100:2000;115-121.
20. D. Damanik, Gordon-type arguments in the spectral theory of one-dimensional quasicrystals, in: M. Baake, R.V. Moody (Eds.), Directions in Mathematical Quasicrystals, CRM Monograph Series, vol. 13, AMS, Providence, RI, 2000, pp. 277-304; math-ph/9912005.
21. Damanik D., Zare D. Palindrome complexity bounds for primitive substitution sequences. Discrete Math. 222:2000;259-267.
22. Dekking F.M. What is the long range order in the Kolakoski sequence? Moody R.V. The Mathematics of Long-Range Aperiodic Order, NATO ASI Series, Series C., Mathematics of Physical Science, vol. 489. 1997;115-125 Kluwer, Dordrecht.
23. M. Dekking, M. Mendès France, A.J. van der Poorten, FOLDS!, Math. Intell. 4 (1982) 130-138, 173-181, 190-195.
24. Droubay X. Palindromes in the Fibonacci word. Inform. Process. Lett. 55:1995;217-221.
25. Droubay X., Justin J., Pirillo G. Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255:2001;539-553.
26. Droubay X., Pirillo G. Palindromes and Sturmian words. Theoret. Comput. Sci. 223:1999;73-85.
27. Ehrenfeucht A., Lee K.P., Rozenberg G. Subword complexities of various classes of deterministic developmental languages without interaction. Theoret. Comput. Sci. 1:1975;59-75.
28. Ferenczi S. Les transformations de Chacon: combinatoire, structure géométrique, lien avec les systèmes de complexité 2n+1 Bull. Soc. Math. France. 123:1995;271-292.
29. Ferenczi S. Complexity of sequences and dynamical systems. Discrete Math. 206:1999;145-154.
30. Ferenczi S., Kása Z. Complexity for finite factors of infinite sequences. Theoret. Comput. Sci. 218:1999;177-195.
31. Fine N.J., Wilf H.S. Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16:1965;109-114.
32. Hof A., Knill O., Simon B. Singular continuous spectrum for palindromic Schrödinger operators. Commun. Math. Phys. 174:1995;149-159.
33. Justin J., Pirillo G. Episturmian words and episturmian morphisms. Theoret. Comput. Sci. 276:2002;281-313.
34. W. Kolakoski, Elementary problem 5304, Amer. Math. Monthly 72 (1965) 674; Solution 73 (1966) 681-682.
35. W. Kolakoski, Elementary problem 5304, Amer. Math. Monthly 72 (1965) 674; Solution 73 (1966) 681-682.
36. A. Ladouceur, Outil logiciel pour la combinatoire des mots, Mémoire de Maîtrise, UQAM, Montréal, 1999.
37. Lunnon W.F., Pleasants P.A.B. Characterization of two-distance sequences. J. Austral. Math. Soc. Ser. A. 53:1992;198-218.
38. P in a free group Michigan Math. J. 9:1962;289-298.
39. Mendès France M., Tenenbaum G. Dimension des courbes planes, papiers pliés et suites de Rudin-Shapiro. Bull. Soc. Math. France. 109:1981;207-215.
40. P. Michel, Sur les ensembles minimaux engendrés par les substitutions de longueur non constante, Thèse, Université de Rennes, 1975.
41. Michel P. Stricte ergodicité d'ensembles minimaux de substitution. Conze J.-P., Keane M.S. Théorie Ergodique, Actes des Journées Ergodiques, Rennes 1973/1974. Lecture Notes in Mathematics. vol. 532:1976;189-201 Springer, Berlin.
42. Morse M., Hedlund G.A. Symbolic dynamics, II, Sturmian trajectories. Amer. J. Math. 62:1940;1-42.
43. Mossé B. Puissances de mots et reconnaissabilité des points fixes d'une substitution. Theoret. Comput. Sci. 99:1992;327-334.
44. Mossé B. Reconnaissabilité des substitutions et complexité des suites automatiques. Bull. Soc. Math. France. 124:1996;329-346.
45. Queffélec M. Une nouvelle propriété des suites de Rudin-Shapiro. Ann. Inst. Fourier. 37:1987;115-138.
46. J.-J. Pansiot, Complexité des facteurs des mots infinis engendrés par morphismes itérés, in: Automata, Languages and Programming, Antwerp, 1984, Lecture Notes in Computer Science, vol. 172, Springer, Berlin, 1984, pp. 380-389.
47. Rote G. Sequences with subword complexity. 2n J. Number Theory. 46:1994;196-213.
48. M. Schlottmann, Generalized model sets and dynamical systems, in: M. Baake, R.V. Moody (Eds.), Directions in Mathematical Quasicrystals, CRM Monograph Series, vol. 13, AMS, Providence, RI, 2000 pp. 143-159.