The origins of combinatorics on words

European Journal of Combinatorics

Volumn 28, Issue 3, 2007, Pages 996-1022

  Berstel, Jean ^a   Perrin, Dominique ^a  

^a Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 37849187447     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2005.07.019     Document Type: Article

References (144)

1. van Aardenne-Ehrenfest T., and de Bruijn N.G. Circuits and trees in oriented linear graphs. Simon Stevin 28 (1951) 203-217
2. Adjan S.I. The Burnside Problem and Identities in Groups (1979), Springer
3. Allouche J.-P., and Shallit J. The ubiquitous Prouhet-Thue-Morse sequence. In: Ding C., Helleseth T., and Niederreiter H. (Eds). Sequences and their Applications, Proceedings of SETA'98 (1999), Springer Verlag 1-16
4. Allouche J.-P., and Shallit J. Automatic Sequences (2003), Cambridge University Press
5. André D. Solution directe du problème résolu par M. Bertrand. Comptes Rendus Acad. Sci. Paris 105 (1887) 436-437
6. Aršon S.E. Proof of the existence of infinite asymmetric sequences. Mat. Sb. 44 (1937) 769-777 (in Russian)
7. Barbier É. Généralisation du problème résolu par M.J. Bertrand. Comptes Rendus Acad. Sci. Paris 105 (1887) 407
8. Bean D.R., Ehrenfeucht A., and McNulty G. Avoidable patterns in strings of symbols. Pacific J. Math. 85 (1979) 261-294
9. Bebutov M.V. On dynamical systems in the space of continuous functions. Bull. Mos. Gos. Univ. Math. 2 (1940)
10. Jean Bernoulli, Sur une nouvelle espèce de calcul, in: Recueil pour les Astronomes, vol. 1, Berlin, 1772, pp. 255-284
11. Jean Berstel, Axel Thue's work on repetitions in words, in: P. Leroux, C. Reutenauer (Eds.), Séries Formelles et Combinatoire Algébrique, Publications du LaCIM, Université du Québec à Montreal, 1992, pp. 65-80
12. Bertrand J. Solution d'un problème. Comptes Rendus Acad. Sci. Paris 105 (1887) 369
13. Binet J. Réflexions sur le problème de déterminer le nombre de manières dont une figure rectiligne peut être partagée en triangles au moyen de ses diagonales. J. Math. Pures. Appl. 4 (1839) 91-94
14. Birkhoff G.D. Dynamical Systems. Amer. Math. Soc. Colloq. Publi. vol. 9 (1927), Amer. Math. Soc.
15. Borchardt C.W. Ueber eine der Interpolation entsprechende Darstellung der Eliminations-Resultante. J. Reine Angew. Math. 57 (1860) 111-121
16. Brzozowski J., Culik K., and Gabrielian A. Classification of noncounting events. J. Comput. System Sci. 5 (1971) 41-53
17. Büchi R. In: Siefkes D. (Ed). Finite Automata, their Algebras and Grammars (1989), Springer-Verlag
18. Burnside W. On an unsettled question in the theory of discontinuous groups. Quart. J. Pure Appl. Math. 33 (1902) 230-238
19. Catalan E. Addition à la note sur une équation aux différences finies, insérée dans le volume précédent. J. Math. Pures Appl. 4 (1839) 95-99
20. Cayley A. A theorem on trees. Quart. J. Pure Appl. Math. 23 (1889) 376-378
21. Chen K.T., Fox R.H., and Lyndon R.C. Free differential calculus. Ann. of Math. 68 (1958) 81-95
22. Chomsky N., and Schützenberger M.P. The algebraic theory of context-free languages. In: Braffort P., and Hirshberg D. (Eds). Computer Programming and Formal Systems (1963), North-Holland
23. Christoffel E.B. Observatio arithmetica. Annali di Mathematica 6 (1875) 145-152
24. Cobham A. Uniform tag sequences. Math. Syst. Theory 6 (1972) 164-192
25. Cohn P.M. On subsemigroups of free semigroups. Proc. Amer. Math. Soc. 63 (1962) 347-351
26. Coudrain M., and Schützenberger M.-P. Une condition de finitude des monoïdes finiment engendrés. Comptes Rendus Acad. Sci. Paris 262 (1966) 1149-1151
27. Crapo H., and Rosenstiehl P. On lacets and their manifolds. Discrete Math. 233 (2001) 299-320
28. Dawson R., and Good I.J. Exact Markov probabilities from oriented linear graphs. Ann. Math. Stat. 28 (1957) 946-956
29. de Bruijn N.G. A combinatorial problem. Nederl. Akad. Wetensch. Proc 49 (1946) 758-764
30. n zeros and ones that show each n-letter word exactly once, Technical Report, Technische Hogeschool Eindhoven, 1975
31. Leonard Eugene Dickson, History of the Theory of Numbers, vol. 2, Washington, 1920
32. Dvoretsky A., and Motzkin T.S. A problem in arrangements. Duke Math. J. 14 (1947) 305-313
33. von Dyck W.F.A. Gruppentheoretische Studien. Math. Ann. 20 (1882) 1-44
34. von Dyck W.F.A. Gruppentheoretische Studien II. Ueber die Zusammensetzung einer Gruppe discreter Operationen, über ihre Primitivität und Transitivität. Math. Ann. 22 (1883) 70-108
35. Ehrenfeucht A., Karhumäki J., and Rozenberg G. On binary equality sets and a solution to the Ehrenfeucht conjecture in the binary case. Theoret. Comput. Sci. 21 (1982) 119-144
36. Eilenberg S. Automata, Languages and Machines vol. A (1974), Academic Press
37. Epstein D.B., Cannon J., Hold D., Levy S., Paterson M., and Thurston W. Word Processing in Groups (1992), Jones and Bartlett
38. Erdös P., and Turan P. On some sequences of integers. J. London Math. Soc. 11 (1936) 261-264
39. Escott E.B. The calculation of logarithms. Quart. J. Math. 41 (1910) 147-167
40. Escott E.B. Logarithmic series. Quart. J. Math. 41 (1910) 141-156
41. Euler L. Solutio problematis ad geometrian situs pertinentis. Comm. Acad. Sci. Imper. Petropol. 8 (1736) 128-140
42. Feller W. An Introduction to Probability Theory and its Applications, vol. I. third ed. (1968), Wiley & Sons
43. Fine N.J., and Wilf H.S. Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16 (1965) 109-114
44. Flye Sainte-Marie C. Question 48. L'intermédiaire des mathématiciens 1 (1894) 107-110
45. Fredricksen H., and Maiorana J. Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Math. 23 3 (1978) 207-210
46. Fürstenberg H. Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions. J. Anal. Math. 31 (1977) 204-256
47. Fürstenberg H. Recurrence in Ergodic Theory and Combinatorial Number Theory (1981), Princeton University Press
48. Gauss C.F. Werke (1900), Teubner, Leipzig
49. Gödel K. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatsh. Math. Phys. 38 (1931) 173-198
50. Golomb S. Shift Register Sequences (1967), Holden Day
51. Good I.J. Normal recurring decimals. J. London Math. Soc. 21 (1946) 167-169
52. Graham R.L., Knuth D.E., and Pataschnik O. Concrete Mathematics (1988), Addison Wesley
53. Graham R.L., Rothshild B., and Spencer J. Ramsey Theory (1980), Wiley
54. r = x. Math. Proc. Camb. Phil. Soc. 48 (1952) 35-40
55. Grünbaum B. Arrangements and spreads. Conference Board of the Math. Sciences Regional Conf. Ser. in Math. vol. 10 (1972), Amer. Math. Soc.
56. Hadamard J. Les surfaces à courbures opposées et leurs géodésiques. J. Math. Pures Appl. 4 (1898) 27-73
57. Hall M. Theory of Groups (1959), Chelsea
58. Hardy G.H., and Wright E.M. An Introduction to the Theory of Numbers (1979), Oxford University Press
59. Hedlund G.A. Remarks on the work of Axel Thue on sequences. Normat 15 (1967) 148-150
60. Hmelevskii Yu.I. Equations in free semigroups. Proc. Steklov Inst. Math. 107 (1971) (Amer. Math. Soc. translation 1976, p. 270)
61. Hopcroft J.E., and Ullman J. Formal Languages and their Relation to Automata (1969), Addison Wesley
62. Jacobson N. Structure of Rings. American Math. Soc. Colloquium Publ. vol. 37, revised edition (1964), American Math. Soc.
63. Kharlampovich O., and Myasnikov A. Tarki's problem about the elementary theory of free groups has a positive solution. Electron. Res. Announc. 4 (1998) 101-108
64. Kirchhoff G. Ueber die Auflösung der Gleichungen auf welche man bei der untersuchung der Lineare Vertheilung galvanischer Ströme gführt wird. Ann. Phys. Chem. 72 (1847) 497-508
65. Knuth D.E. Oriented subtrees of an arc digraph. J. Combin. Theory 3 (1967) 309-314
66. Knuth D.E. The Art of Computer Programming, Volume 1, Fundamental Algorithms (1968), Addison Wesley Second edition, 1973
67. Knuth D.E. The Art of Computer Programming, Volume 2, Seminumerical Algorithms (1969), Addison Wesley
68. Knuth D.E. The Art of Computer Programming Fascicule 2 : Generating All Tuples And Permutations (2005), Addison Wesley
69. Knuth D.E., Morris J.H., and Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6 (1977) 323-350
70. Kolotov A.T. Free subalgebras of free associative algebras. Sibirsk. Math. Z 19 (1978) 328-335 (in Russian). English translation: Siberian Math. J. 19 (1978) 229-234
71. Lentin A. Equations dans les Monoïdes Libres (1972), Gauthier-Villars, Paris
72. Levi F.W. On semigroups. Bull. Calcutta Math. Soc. 36 (1944) 141-146
73. Lind D., and Marcus B. Symbolic Dynamics and Coding (1995), Cambridge University Press
74. Lothaire M. Combinatorics on Words. Encyclopedia of Mathematics and its Applications vol. 17 (1983), Addison-Wesley, Reading, Mass.
75. Lothaire M. Combinatorics on Words (1997), Cambridge Mathematical Library. Cambridge University Press, Cambridge Corrected reprint of the 1983 original
76. Lothaire M. Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications vol. 90 (2002), Cambridge University Press, Cambridge
77. Lothaire M. Applied Combinatorics on Words (2005), Cambridge University Press
78. Lovasz L., and Marx M.L. A forbidden substructure characterization of Gauss codes. Bull. Amer. Math. Soc. 82 (1976) 121-122
79. De Luca A., and Varricchio S. Finiteness and Regularity in Semigroups and Formal Languages (1999), Springer-Verlag
80. Lucas E. Théorie des Nombres (1891), Gauthier-Villars reprinted by Albert Blanchard, 1961
81. Lucasiewicz J. Aristotle's Syllogistic from the Standpoint of Modern Formal Logic (1951), Oxford University Press
82. Lyndon R.C. On Burnside problem I. Trans. Amer. Math. Soc. 77 (1954) 202-215
83. Lyndon R.C., and Schupp P. Combinatorial Group Theory (1977), Springer-Verlag
84. p in a free group. Michigan Math. J. 9 (1962) 289-298
85. MacMahon P.A. Application of a theory of permutations in circular procession to the theory of numbers. Proc. London Math. Soc. 23 (1892) 305-313
86. Magnus W., Karass A., and Solitar D. Combinatorial Group Theory: presentation of groups in terms of generators and relations (1966), Dover
87. Mantel W. Resten van wederkerige reeksen. Nieuw Arch. Wisk. 1 (1895) 172-184
88. Markov A.A. Sur une question de Jean Bernoulli. Math. Ann. 19 (1882) 27-36
89. Markov A.A. On the impossibility of certain algorithms in the theory of associative systems. Dokl. Akad. Nauk. 55 (1947) 583-586 58 353-356 (in Russian)
90. Martin M.H. A problem in arrangements. Bull. Amer. Math. Soc. 40 (1934) 859-864
91. Marx M.L. The Gauss realizability problem. Proc. Amer. Math. Soc. 22 (1969) 610-613
92. Morse M. Recurrent geodesics on a surface of negative curvature. Trans. Amer. Math. Soc. 22 (1921) 84-100
93. Marston Morse, Symbolic dynamics. Lectures at Princeton university, notes by Rufus Oldenburger, 1937
94. Morse M., and Hedlund G.A. Symbolic dynamics. Amer. J. Math. 60 (1938) 815-866
95. Morse M., and Hedlund G.A. Symbolic dynamics II: Sturmian sequences. Amer. J. Math. 62 (1940) 1-42
96. Neumann B.H. Adjunction of elements to groups. J. London Math. Soc. 18 (1943) 12-20
97. Nielsen J. Die Isomorphismen der allgemeinen unendlichen Gruppe mit zwei Erzeugenden. Math. Ann. 78 (1918) 385-397
98. Jakob Nielsen, Om Regning med ikke kommutative Faktorer og dens Andvendelse i Gruppenteorien. Mat. Tidsskrift B, (1921) 77-94
99. Novikov P.S. On the algorithmic unsolvability of the word problem in groups. Tr. Mat. Inst. Steklova 55 (1955)
100. Poincaré H. Méthodes Nouvelles de la Mécanique Céleste, vol. I, II, III (1892), Gauthier-Villars 1893, 1899
101. Post E.L. Finite combinatory processes-formulation 1. J. Symbolic Logic 1 3 (1936) 103-105
102. Post E.L. A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc. 52 (1946) 264-268
103. Post E.L. Recursive unsolvability of a problem of Thue. J. Symbolic Logic 12 (1947) 1-11
104. Presburger M. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Comptes Rendus 1er Congr. Math. Pays Slaves (1929), Warszawa 92-101
105. Prouhet E. Mémoire sur quelques relations entre les puissances des nombres. C.R. Acad. Sci. Paris 33 (1851) 255
106. Prüfer H. Neuer Beweis eines Satzes über Permutationen. Arch. Math. u. Phys. 27 (1918) 142-144
107. Fogg N.P. In: Berthé V., Ferenczi S., Mauduit C., and Siegel A. (Eds). Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Mathematics vol. 1794 (2002), Springer-Verlag
108. Quine W.V. Concatenation as a basis for arithmetic. J. Symbolic Logic 4 (1946) 105-114
109. Rabin M.O. Recursive unsolvability of group-theoretic problems. Ann. Math. 67 (1958) 172-194
110. Ramsey F.P. On a problem of formal logic. Proc. London Math. Soc. 30 (1930) 264-286
111. Raney G. Functional composition patterns and power series reversion. Trans. Amer. Math. Soc. 94 (1960) 441-451
112. David Rees, Note on a paper by I. J. Good, J. London Math. Soc. 21 (1947) 169-172
113. de Rivière A. Question 48. L'intermédiaire des mathématiciens 1 (1894) 19-20
114. Robbins H.E. On a class of recurrent sequences. Bull. Amer. Math. Soc. 43 (1937) 413-417
115. Rosenstiehl P. Solution algébrique du problème de Gauss sur la permutation des points d'intersection d'une ou plusieurs courbes fermées du plan. C. R. Acad. Sci. Paris 283 (1976) 417-419
116. Rosenstiehl P. A new proof of the Gauss interlace conjecture. Adv. in Appl. Math. 23 (1999) 3-13
117. Sapir M.V. Problems of Burnside type and the finite basis property in varieties of semigroups. Izv. Akad. Nauk SSSR Ser. Mat. 51 2 (1987) 319-340, 447
118. Schreier O. Die Untergruppen der freien Gruppen. Abh. Math. Sem. Hamburg 5 (1927) 161-183
119. o. 15
120. Schützenberger M.-P. On a factorization of free monoids. Proc. Amer. Math. Soc. 16 (1965) 21-24
121. Sims C. Computation with finitely presented groups (1994), Cambridge University Press
122. Smale S. Differentiable dynamical systems. Bull. Amer. Math. Soc. 73 (1967) 747-817
123. Smith C.A., and Tutte W.T. On unicursal paths in a network of degree 4. Amer. Math. Monthly 48 (1941)
124. Steinby M., and Thomas W. Trees and term rewriting in 1910: on a paper by Axel Thue. Bull. EATCS 72 (2000) 256-269
125. Stillwell J. Classical Topology and Combinatorial Group Theory (1980), Springer-Verlag
126. Stillwell J. Mathematics and its History (1989), Springer-Verlag
127. Szemeredi E. On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27 (1975) 199-245
128. Tarry G. Question 4100. L'intermédiaire des mathématiciens 19 (1912) 200 Answers to the question were given by E. Barbette, E. Miot, and Welsch in vol. 20 (1913) 68-70
129. Thue A. Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I Math-Nat. Kl. 7 (1906) 1-22
130. Thue A. Die Lösung eines Spezialfalles eines generellen logischen Problems. Norske Vid. Selsk. Skr. I Math-Nat. Kl. Chris. 8 (1910)
131. Thue A. Über die gegenseitige Loge gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I Math-Nat. Kl. Chris. 1 (1912) 1-67
132. Thue A. Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. Norske Vid. Selsk. Skr. I Math-Nat. Kl. Chris. 10 (1914)
133. Tietze H. Über die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten. Monat. Math. Phys. 19 (1908) 1-118
134. Todd J.A., and Coxeter H.S.M. A practical method for enumerating the cosets of a finite abstract group. Proc. Edinburgh Math. Soc. 5 (1936) 25-34
135. Treybig L.B. A characterization of the double point structure of the projection of a polygonal knot in regular position. Trans. Amer. Math. Soc. (1968) 223-247
136. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42 (1936) 230-265
137. Tutte W.T. Graph Theory (2001), Cambridge University Press
138. van der Waerden B.L. Beweis einer Baudet'schen Vermutung. Nieuw Arch. Wiskd. 15 (1927) 212-216
139. Bartel Leendert van der Waerden, Wie der Beweis der Vermutung von Baudet gefunden wurde, in: Abhandlungen des Mathematischen Seminars des Hanseatischen Universität Hamburg, 1965, pp. 6-15 (also published as: [How the proof of Baudet's conjecture was found, Studies in Pure Mathematics, Academic Press, 1971, pp. 251-260)
140. Venkov B.A. Elementary Number Theory (1970), Wolters-Noordhoff, Groningen
141. Weiss B. Subshifts of finite type and sofic systems. Monatsh. Math. 77 (1973) 462-474
142. Wen Z.-X., and Wen Z.-Y. Local isomorphisms of invertible substitutions. Comptes Rendus Acad. Sci. 318 (1994) 299-304
143. Witt E. Treue Darstellung Lieschen Ringe. J. Reine Angew. Math. 177 (1937) 152-160
144. Zimin A.I. Blocking sets of terms. Mat. Sb. 119 3 (1982) 363-375 (in Russian). English translation in Math. USSR Sbornik 47 (1984) 353-364