The entropy of square-free words

Mathematical and Computer Modelling

Volumn 26, Issue 8-10, 1997, Pages 13-26

  Baare, M ^a   Elser, V ^a,b   Grimm, U ^c  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b Laboratory of Atomic and Solid State Physics and Sibley School of Mechanical and Aerospace Engineering   (United States)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Combinatorics on words; Entropy; Random tilings; Substitution rules

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; RANDOM PROCESSES;

ENTROPY DENSITY; RANDOM TILING MODELS; SUBSTITUTION RULES;

COMBINATORIAL MATHEMATICS;

EID: 0031259289     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(97)00196-9     Document Type: Conference Paper

References (25)

1. V. Berthé, Entropy in deterministic and random systems, In Beyond Quasicrystals, (Edited by F. Axel and D. Gratias), pp. 441-463, Springer, Berlin, (1995).
2. nd edition, Clarendon Press, Oxford, (1994).
3. H.-U. Nissen and C. Beeli, Electron microscopy of quasicrystals and the validity of the tiling approach, Int. J. Mod. Phys. B7, 1387-1413 (1993).
4. C.L. Henley, Random tiling models, In Quasicrystals - The State of the Art, (Edited by D.P. DiVincenzo and P.J. Steinhardt), pp. 429-524, World Scientific, Singapore, (1991).
5. K. Petersen, Ergodic Theory, Cambridge University Press, Cambridge, (1983).
6. C.J. Thompson, Mathematical Statistical Mechanics, Princeton University Press, Princeton, NJ, (1979).
7. P.A. Kalugin, The square-triangle random-tiling model in the thermodynamic limit, J. Phys. A27, 3599-3614 (1994).
8. J.-P. Allouche and M. Mendès France, Automata and automatic sequences, In Beyond Quasicrystals, (Edited by F. Axel and D. Gratias), pp. 293-367, Springer, Berlin, (1995).
9. A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 7, 1-22 (1906); Reprinted in Selected Mathematical Papers of Axel Thue, (Edited by T. Nagell, A. Selberg, S. Selberg and K. Thalberg), pp. 139-158, Universitetsforlaget, Oslo, (1977).
10. A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 7, 1-22 (1906); Reprinted in Selected Mathematical Papers of Axel Thue, (Edited by T. Nagell, A. Selberg, S. Selberg and K. Thalberg), pp. 139-158, Universitetsforlaget, Oslo, (1977).
11. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana l, 1-67 (1912); Reprinted in Selected Mathematical Papers of Axel Thue, (Edited by T. Nagell, A. Selberg, S. Selberg and K. Thalberg), pp. 413-477, Universitetsforlaget, Oslo, (1977).
12. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana l, 1-67 (1912); Reprinted in Selected Mathematical Papers of Axel Thue, (Edited by T. Nagell, A. Selberg, S. Selberg and K. Thalberg), pp. 413-477, Universitetsforlaget, Oslo, (1977).
13. P.A.B. Pleasants, Nonrepetitive sequences, Proc. Cambr. Philos. Soc. 68, 267-274 (1970).
14. D.R. Bean, A. Ehrenfeucht and G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85, 261-294 (1979).
15. M. Crochemore, Sharp characterizations of squarefree morphisms, Theor. Comp. Sci. 18, 221-226 (1982).
16. J. Berstel and C. Reutenauer, Square-free words and idempotent semigroups, In Combinatorics on Words, (Edited by M. Lothaire), Encyclopedia of Mathematics and Its Applications, Vol. 17, pp. 18-38, Addison-Wesley, Reading, MA, (1983).
17. M. Crochemore, Tests sur les morphismes faiblement sans carré, In Combinatorics on Words, (Edited by L.J. Cummings), pp. 63-89, Academic Press, Toronto, (1983).
18. R.O. Shelton, On the structure and extendability of square-free words, In Combinatorics on Words, (Edited by L.J. Cummings), pp. 101-118, Academic Press, Toronto, (1983).
19. V. Elser, Repeat-free sequences, Preprint LBL-16632, Lawrence Berkeley Laboratory, (1983).
20. th power-free homomorphisms, Theor. Comp. Sci. 23, 69-82 (1983).
21. J. Brinkhuis, Non-repetitive sequences on three symbols, Quart. J. Math. Oxford 34, 145-149 (1983).
22. th power-free codes, In Automata on Infinite Words, Lecture Notes in Computer Science 192, (Edited by M. Nivat and D. Perrin), pp. 172-187, Springer, Berlin, (1985).
23. P. Séébold, Overlap-free sequences, In Automata on Infinite Words, Lecture Notes in Computer Science 192, (Edited by M. Nivat and D. Perrin), pp. 207-215, Springer, Berlin, (1985).
24. Y. Kobayashi, Repetition-free words, Theor. Comp. Sci. 44, 175-197 (1986).
25. P.A.B. Pleasants, Entropies of sequences with the same language (in preparation), and private communication.