Sequences, Groups, and Number Theory

No full text

Collective work published as editor or director (Books)

Berthé, Valérie; Rigo, Michel

2018 • Birkhäuser

Permalink
https://hdl.handle.net/2268/222387

Files (0)Send to Details Statistics Bibliography Similar publications

Files

Full Text

No document available.

Send to

RIS BibTex APA Chicago Permalink X Linkedin

Details

Keywords :

Number Theory; Sequences; Combinatorics on words; Dynamical systems; Ergodic Theory; Automata

Abstract :

[en] This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups. This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

Disciplines :

Mathematics

Editor :

Berthé, Valérie

Rigo, Michel ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes

Language :

English

Title :

Sequences, Groups, and Number Theory

Publication date :

2018

Publisher :

Birkhäuser

Collection name :

Trends in Mathematics

Additional URL :

http://www.springer.com/gp/book/9783319691510

Available on ORBi :

since 18 April 2018

Statistics

Number of views

51 (5 by ULiège)

Number of downloads

0 (0 by ULiège)

More statistics

Scopus citations^®

Scopus citations^®
without self-citations

Bibliography

Adamczewski, B., Bell, J.P., An analogue of Cobham’s theorem for fractals (2011) Trans. Am. Math. Soc., 363 (8), pp. 4421-4442
Adamczewski, B., Bell, J.P., A problem around Mahler functions (2013) Ann. Sc. Norm. Super. Pisa
Adamczewski, B., Bugeaud, Y., On the complexity of algebraic numbers. I. Expansions in integer bases (2007) Ann. Math., 165 (2), pp. 547-565
Adamczewski, B., Faverjon, C., Méthode de Mahler: Relations linéaires, transcendance et application aux nombres automatiques (2017) Proc. Lond. Math. Soc., 115, pp. 55-90
Adyan, S.I., Random walks on free periodic groups (1982) Izv. Akad. Nauk SSSR Ser. Mat., 46 (6), pp. 1139-1149
Agafonov, V.N., Normal sequences and finite automata (1968) Sov. Math. Dokl., 9, pp. 324-325
Ahlfors, L., Zur theorie der überlagerungsflächen (1935) Acta Math, 65 (1), pp. 157-194
Aistleitner, C., Becher, V., Scheerer, A.M., Slaman, T., On the construction of absolutely normal numbers Acta Arith.
Akhavi, A., Klimann, I., Lombardy, S., Mairesse, J., Picantin, M., On the finiteness problem for automaton (Semi)groups (2012) Int. J. Algebra Comput., 22 (6), pp. 1-26
Albeverio, S., Pratsiovytyi, M., Torbin, G., Singular probability distributions and fractal properties of sets of real numbers defined by the asymptotic frequencies of their s-adic digits (2005) Ukraïn. Mat. Zh., 57 (9), pp. 1163-1170
Alešin, S., Finite automata and the Burnside problem for periodic groups (1972) Mat. Zametki, 11, pp. 319-328
Allouche, J.-P., Rampersad, N., Shallit, J., Periodicity, repetitions, and orbits of an automatic sequence (2009) Theor. Comput. Sci., 410 (30-32), pp. 2795-2803
Allouche, J.-P., Scheicher, K., Tichy, R.F., Regular maps in generalized number systems (2000) Math. Slovaca, 50, pp. 41-58
Allouche, J.-P., Shallit, J., (2003) Automatic Sequences: Theory, Applications, Generalizations, , Cambridge University Press, Cambridge
Allouche, J.-P., Shallit, J., The ring of k-regular sequences. II (2003) Theor. Comput. Sci., 307 (1), pp. 3-29
Allouche, J.-P., Shallit, J.O., The ring of k-regular sequences (1990) STACS 90, Proceedings of the 7Th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, 415, pp. 12-23. , Choffrut, C., Lengauer, T. (eds.), Springer, Berlin
Allouche, J.-P., Shallit, J.O., The ring of k-regular sequences (1992) Theor. Comput. Sci., 98, pp. 163-197
Allouche, J.-P., Shallit, J.O., The ubiquitous Prouhet-Thue-Morse sequence (1999) Sequences and Their Applications, Proceedings of SETA ’98, pp. 1-16. , Ding, C., Helleseth, T., Niederreiter, H. (eds.), Springer, London
Alvarez, N., Becher, V., M. Levin’s construction of absolutely normal numbers with very low discrepancy Math. Comput.
Amitsur, A.S., Levitzki, J., Minimal identities for algebras (1950) Proc. Am. Math. Soc., 1, pp. 449-463
Amitsur, S.A., Small, L.W., Affine algebras with polynomial identities (1993) Rend. Circ. Mat. Palermo, 2, pp. 9-43. , Recent developments in the theory of algebras with polynomial identities (Palermo, 1992)
Anantharaman-Delaroche, C., Renault, J., Amenable groupoids (2000) Monographies De L’Enseignement Mathématique, 36. , L’Enseignement Mathématique, Geneva
Aubrun, N., Barbieri, S., Sablik, M., A notion of effectiveness for subshifts on finitely generated groups (2017) Theor. Comput. Sci., 661, pp. 35-55
Aubrun, N., Kari, J., (2013) Tiling Problems on Baumslag-Solitar Groups, pp. 35-46. , MCU’13
Aubrun, N., Sablik, M., Multidimensional effective S-adic systems are sofic (2014) Uniform Distribution Theory, 9 (2), pp. 7-29
Avez, A., Entropie des groupes de type fini (1972) C. R. Acad. Sci. Paris Sér. A-B, 275, pp. A1363-A1366
Badkobeh, G., Crochemore, M., Finite-repetition threshold for infinite ternary words (2011) WORDS. EPTCS, 63, pp. 37-43
Badkobeh, G., Crochemore, M., Fewest repetitions in infinite binary words (2012) RAIRO Theor. Inform. Appl., 46 (1), pp. 17-31
Badkobeh, G., Crochemore, M., Rao, M., Finite repetition threshold for large alphabets (2014) RAIRO Theor. Inform. Appl., 48 (4), pp. 419-430
Baek, I.S., Olsen, L., Baire category and extremely non-normal points of invariant sets of IFS’s (2010) Discrete Contin. Dyn. Syst, 27 (3), pp. 935-943
Bailey, D.H., Borwein, J.M., Nonnormality of stoneham constants (2012) Ramanujan J, 29 (1), pp. 409-422
Baker, K.A., McNulty, G.F., Taylor, W., Growth problems for avoidable words (1989) Theor. Comput. Sci., 69 (3), pp. 319-345
Ballier, A., Jeandel, E., Tilings and model theory (2008) First Symposium on Cellular Automata Journées Automates Cellulaires
Ballier, A., Jeandel, E., Computing (Or not) quasi-periodicity functions of tilings (2010) Second Symposium on Cellular Automata “Journées Automates Cellulaires”, pp. 54-64. , JAC 2010, Turku, Finland, December 15–17, 2010. Proceedings
Banach, S., Tarski, A., Sur la décomposition des ensembles de points en parties respective-ment congruentes (1924) Fundam. Math., 6, pp. 244-277
Barat, G., Berthé, V., Liardet, P., Thuswaldner, J., Dynamical directions in numeration (2006) Ann. Inst. Fourier (Grenoble), 56 (7), pp. 1987-2092
Barbieri, S., Sablik, M., A generalization of the simulation theorem for semidirect products Ergodic Theory Dyn. Syst.
Bartholdi, L., The growth of Grigorchuk’s torsion group (1998) Int. Math. Res. Not., 20, pp. 1049-1054
Bartholdi, L., Counting paths in graphs (1999) Enseign. Math, 45 (1-2), pp. 83-131
Bartholdi, L., On amenability of group algebras, I (2008) Isr. J. Math., 168, pp. 153-165
Bartholdi, L., Gardens of Eden and amenability on cellular automata (2010) J. Eur. Math. Soc., 12 (1), pp. 241-248
Bartholdi, L., Grigorchuk, R.I., Šuniḱ, Z., (2003) Handbook of Algebra, 3, pp. 989-1112. , chap. Branch groups
Bartholdi, L., Kaimanovich, V.A., Nekrashevych, V.V., On amenability of automata groups (2010) Duke Math. J., 154 (3), pp. 575-598
Bartholdi, L., Kielak, D., (2016) Amenability of Groups is Characterized by Myhill’s Theorem
Bartholdi, L., Virág, B., Amenability via random walks (2005) Duke Math. J., 130 (1), pp. 39-56
Bass, H., The degree of polynomial growth of finitely generated nilpotent groups (1972) Proc. Lond. Math. Soc., 25 (3), pp. 603-614
Baumgartner, J.E., A short proof of Hindman’s theorem (1974) J. Comb. Theory Ser. A, 17, pp. 384-386
Bean, D.R., Ehrenfeucht, A., McNulty, G., Avoidable patterns in strings of symbols (1979) Pac. J. Math., 85, pp. 261-294
Becher, V., Bugeaud, Y., Slaman, T., On simply normal numbers to different bases (2016) Math. Ann., 364 (1), pp. 125-150
Becher, V., Carton, O., Heiber, P.A., Finite-state independence Theory Comput. Syst.
Becher, V., Figueira, S., An example of a computable absolutely normal number (2002) Theor. Comput. Sci., 270, pp. 947-958
Becher, V., Figueira, S., Picchi, R., Turing’s unpublished algorithm for normal numbers (2007) Theor. Comput. Sci., 377, pp. 126-138
Becher, V., Heiber, P., Slaman, T., A polynomial-time algorithm for computing absolutely normal numbers (2013) Inf. Comput., 232, pp. 1-9
Becher, V., Heiber, P., Slaman, T., A computable absolutely normal Liouville number (2015) Math. Comput., 84 (296), pp. 2939-2952
Becher, V., Heiber, P.A., On extending de Bruijn sequences (2011) Inf. Process. Lett., 111 (18), pp. 930-932
Becher, V., Heiber, P.A., Normal numbers and finite automata (2013) Theor. Comput. Sci., 477, pp. 109-116
Becher, V., Heiber, P.A., Carton, O., Normality and automata (2015) J. Comput. Syst. Sci., 81, pp. 1592-1613
Becher, V., Slaman, T.A., On the normality of numbers to different bases (2014) J. Lond. Math. Soc., 90 (2), pp. 472-494
Becker, H., Kechris, A.S., The descriptive set theory of Polish group actions (1996) London Mathematical Society Lecture Note Series, 232. , Cambridge University Press, Cambridge
Becker, P.G., Effective measures for algebraic independence of the values of Mahler type functions (1991) Acta Arith, 58 (3), pp. 239-250
Becker, P.G., K-regular power series and Mahler-type functional equations (1994) J. Number Theory, 49 (3), pp. 269-286
Bekka, M.E.B., de La Harpe, P., Valette, A., Kazhdan’s property (T) (2008) New Mathematical Monographs, 11. , Cambridge University Press, Cambridge
Bell, J.P., Bugeaud, Y., Coons, M., Diophantine approximation of Mahler numbers (2015) Proc. Lond. Math. Soc., 110 (5), pp. 1157-1206
Bell, J.P., Coons, M., Transcendence tests for Mahler functions (2017) Proc. Am. Math. Soc, 145 (3), pp. 1061-1070
Bell, J.P., Coons, M., Hare, K.G., The minimal growth of a k-regular sequence (2014) Bull. Aust. Math. Soc., 90 (2), pp. 195-203
Bell, J.P., Coons, M., Rowland, E., The rational-transcendental dichotomy of Mahler functions (2013) J. Integer Seq., 16 (2), p. 11
Benjamini, I., (2011) Coarse Geometry and Randomness. Lecture Notes in Mathematics, 2100. , Springer, Cham (2013). Lecture notes from the 41st Probability Summer School held in Saint-Flour
Benjamini, I., Schramm, O., Percolation beyond zd, many questions and a few answers (1996) Electron. Commun. Probab., 1 (8), pp. 71-82
Benjamini, I., Kozma, G., (2010) Nonamenable Liouville Graphs
Berend, D., Frougny, C., Computability by finite automata and Pisot bases (1994) Math. Syst. Theory, 27, pp. 275-282
Berger, R., (1964) The Undecidability of the Domino Problem, , Ph.D. thesis, Harvard University
Berger, R., The undecidability of the domino problem (1966) Mem. Am. Math. Soc., 66, p. 72
Bernardino, A., Pacheco, R., Silva, M., (2016) Coloring Factors of Substitutive Infinite Words
Berstel, J., Axel Thue’s papers on repetitions in words: A translation (1992) Monographies Du Lacim, 11, pp. 65-80. , LaCIM
Berstel, J., Karhumäki, J., Combinatorics on words—a tutorial (2003) Bull. Eur. Assoc. Theor. Comput. Sci., 79, pp. 178-228
Berstel, J., Perrin, D., The origins of combinatorics on words (2007) Eur. J. Comb., 28, pp. 996-1022
Berstel, J., Reutenauer, C., (2011) Noncommutative Rational Series with Applications. Encyclopedia of Mathematics and Its Applications, 137. , Cambridge University Press, Cambridge
Berthé, V., Rigo, M., Combinatorics, automata and number theory (2010) Encyclopedia of Mathematics and Its Applications, 135. , Cambridge University Press, Cambridge
Berthé, V., Rigo, M., Combinatorics, words and symbolic dynamics (2016) Encyclopedia of Mathematics and Its Applications, 159. , Cambridge University Press, Cambridge
Bertrand-Mathis, A., Points génériques de Champernowne sur certains systèmes codes
application aux θ-shifts (1988) Ergodic Theory Dyn. Syst., 8 (1), pp. 35-51
Bertrand-Mathis, A., Volkmann, B., On.ε
k/-normal words in connecting dynamical systems (1989) Monatsh. Math., 107 (4), pp. 267-279
Besicovitch, A.S., The asymptotic distribution of the numerals in the decimal representation of the squares of the natural numbers (1934) Math. Z., 39, pp. 146-156
Bézivin, J.P., Sur une classe d’équations fonctionnelles non linéaires (1994) Funkcial. Ekvac., 37 (2), pp. 263-271
Biggs, N.L., Mohar, B., Shawe-Taylor, J., The spectral radius of infinite graphs (1988) Bull. Lond. Math. Soc., 20 (2), pp. 116-120
Billingsley, P., Hausdorff dimension in probability theory (1960) Ill. J. Math., 4, pp. 187-209
Billingsley, P., Hausdorff dimension in probability theory (1961) II. Ill. J. Math., 5, pp. 291-298
Billingsley, P., (1965) Ergodic Theory and Information, , Wiley, New York
Blanchard, F., Hansel, G., (1986) Systèmes codés. Theor. Comput. Sci., 44 (1), pp. 17-49
Blondel, V.D., Bournez, O., Koiran, P., Papadimitriou, C., Tsitsiklis, J.N., Deciding stability and mortality of piecewise affine dynamical systems (2001) Theor. Comput. Sci., 255 (1-2), pp. 687-696. , Article dans revue scientifique avec comité de lecture
Blondel, V.D., Nesterov, Y., Theys, J., On the accuracy of the ellipsoid norm approximation of the joint spectral radius (2005) Linear Algebra Appl, 394, pp. 91-107
Blondel, V.D., Theys, J., Vladimirov, A.A., An elementary counterexample to the finiteness conjecture (2003) SIAM J. Matrix Anal. Appl., 24 (4), pp. 963-970
Bluhm, C., Liouville numbers, Rajchman measures, and small Cantor sets (2000) Proc. Am. Math. Soc., 128 (9), pp. 2637-2640
Boigelot, B., Brusten, J., A generalization of Cobham’s theorem to automata over real numbers (2009) Theor. Comput. Sci., 410 (18), pp. 1694-1703
Boigelot, B., Brusten, J., Bruyère, V., On the sets of real numbers recognized by finite automata in multiple bases (2010) Log. Methods Comput. Sci., 6, pp. 1-17
Boigelot, B., Brusten, J., Leroux, J., A generalization of Semenov’s theorem to automata over real numbers (2009) Automated Deduction—CADE-22. Lecture Notes in Computer Science, 5663, pp. 469-484. , Springer, Berlin
Boigelot, B., Rassart, S., Wolper, P., On the expressiveness of real and integer arithmetic automata (Extended abstract) (1998) ICALP. Lecture Notes in Computer Science, 1443, pp. 152-163. , Springer, Berlin
Bondarenko, I., Bondarenko, N., Sidki, S., Zapata, F., On the conjugacy problem for finite-state automorphisms of regular rooted trees (2013) Groups Geom. Dyn., 7 (2), pp. 323-355
Bondarenko, I.V., Growth of Schreier graphs of automaton groups (2012) Math. Ann., 354 (2), pp. 765-785
Borel, É., Les probabilités dénombrables et leurs applications arithmétiques (1909) Rendiconti Circ. Mat. Palermo, 27, pp. 247-271
Borel, É., Sur les chiffres décimaux 2 et divers problémes de probabilités en chaîne (1950) C. R. Acad. Sci. Paris, 230, pp. 591-593
Borwein, J., Bailey, D., (2008) Mathematics by Experiment, Plausible Reasoning in the 21St Century, , 2nd edn. A. K. Peters, Ltd, Wellesley, MA
Bousch, T., Mairesse, J., Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture (2002) J. Am. Math. Soc., 15 (1), pp. 77-111
Bowen, R., Periodic points and measures for Axiom A diffeomorphisms (1971) Trans. Am. Math. Soc., 154, pp. 377-397
Bratteli, O., Inductive limits of finite dimensional C*-algebras (1972) Trans. Am. Math. Soc., 171, pp. 195-234
Braun, A., The nilpotency of the radical in a finitely generated PI ring (1984) J. Algebra, 89 (2), pp. 375-396
Brieussel, J., Folner sets of alternate directed groups (2014) Ann. Inst. Fourier (Grenoble), 64 (3), pp. 1109-1130
Brlek, S., Enumeration of factors in the Thue-Morse word (1989) Discrete Appl. Math., 24, pp. 83-96
Brough, T., Cain, A.J., Automaton semigroup constructions (2015) Semigroup Forum, 90 (3), pp. 763-774
Brough, T., Cain, A.J., Automaton semigroups: New constructions results and examples of non-automaton semigroups (2017) Theor. Comput. Sci., 674, pp. 1-15
Brown, T.C., (2006) Colorings of the Factors of a Word, , Preprint, Department of Mathematics, Simon Fraser University, Canada
Brusten, J., (2011) On the Sets of Real Vectors Recognized by Finite Automata in Multiple Bases, , PhD thesis, University of Liège
Bruyère, V., (1985) Entiers Et Automates Finis, , Mémoire de fin d’études, Université de Mons
Bruyère, V., Hansel, G., Bertrand numeration systems and recognizability (1997) Theor. Comput. Sci., 181, pp. 17-43
Bruyère, V., Hansel, G., Michaux, C., Villemaire, R., Logic and p-recognizable sets of integers (1994) Bull. Belg. Math. Soc., 1, pp. 191-238. , Corrigendum, Bull. Belg. Math. Soc. 1 (1994), 577
Büchi, J.R., Weak second-order arithmetic and finite automata (1960) Zeitschrift für Mathematische Logik Und Grundlagen Der Mathematik, 6, pp. 66-92. , Reprinted in Mac Lane, S., Siefkes, D. (eds.) The Collected Works of J. Richard Büchi. Springer, 1990, pp. 398–424
Büchi, J.R., Turing-Machines and the Entscheidungsproblem (1962) Math. Ann., 148 (3), pp. 201-213
Bugeaud, Y., Nombres de Liouville et nombres normaux (2002) C. R. Acad. Sci. Paris, 335 (2), pp. 117-120
Bugeaud, Y., Distribution modulo one and Diophantine approximation (2012) Cambridge Tracts in Mathematics, 193. , Cambridge University Press, Cambridge
Bugeaud, Y., Expansions of algebraic numbers (2015) Four Faces of Number Theory. EMS Series of Lectures in Mathematics, pp. 31-75. , European Mathematical Society, Zürich
Bundschuh, P., Algebraic independence of infinite products and their derivatives (2013) Number Theory and Related Fields. Springer Proceedings in Mathematics and Statistics, 43, pp. 143-156. , Springer, New York
Burks, A.W., (1970) Essays on Cellular Automata, , University of Illinois Press, Urbana, IL
Burnside, W., On an unsettled question in the theory of discontinuous groups (1902) Q. J. Math., 33, pp. 230-238
Cain, A., Automaton semigroups (2009) Theor. Comput. Sci., 410, pp. 5022-5038
Calkin, N.J., Wilf, H.S., (1998) Binary Partitions of Integers and Stern-Brocot-Like Trees, p. 19. , unpublished pp. updated version August 5, 2009
Cannon, J.W., Floyd, W.J., Parry, W.R., Introductory notes on Richard Thompson’s groups (1996) Enseign. Math, 42 (3-4), pp. 215-256
Cantor, G., (1887) Mitteilungen Zur Lehre Vom Transfiniten. Zeitschrift Fr Philosophie Und Philosophische Kritik 91, pp. 81-125
Carpi, A., On abelian power-free morphisms (1993) Int. J. Algebra Comput., 3 (2), pp. 151-167
Carpi, A., On the number of abelian square-free words on four letters (1998) Discret. Appl. Math, 81 (1-3), pp. 155-167
Carpi, A., D’Alonzo, V., On factors of synchronized sequences (2010) Theor. Comput. Sci., 411 (44-46), pp. 3932-3937
Carpi, A., Maggi, C., On synchronized sequences and their separators (2002) Theor. Inform. Appl., 35 (6), pp. 513-524
Carton, O., Heiber, P.A., Normality and two-way automata (2015) Inf. Comput., 241, pp. 264-276
Cassaigne, J., (1994) Motifs évitables Et régularité Dans Les Mots, , Ph.D. thesis, Université Paris VI
Cassaigne, J., Currie, J.D., Schaeffer, L., Shallit, J., Avoiding three consecutive blocks of the same size and same sum (2014) J. ACM, 61 (2), pp. 1-10
Cassaigne, J., Nicolas, F., Quelques propriétés des mots substitutifs (2003) Bull. Belg. Math. Soc. Simon Stevin, 10, pp. 661-676
Cassels, J.W.S., On a problem of Steinhaus about normal numbers (1959) Colloq. Math., 7, pp. 95-101
Ceccherini-Silberstein, T., Coornaert, M., (2010) Cellular Automata and Groups. Springer Monographs in Mathematics, , https://books.google.cl/books?id=N-LSFFaHTKwC, Springer, New York
Ceccherini-Silberstein, T.G., Grigorchuk, R.I., de La Harpe, P., Amenability and paradoxical decompositions for pseudogroups and discrete metric spaces. Trudy Mat. Inst (1999) Steklov, 224, pp. 68-111. , Algebra. Topol. Differ. Uravn. i ikh Prilozh
Ceccherini-Silberstein, T.G., Machì, A., Scarabotti, F., Amenable groups and cellular automata (1999) Ann. Inst. Fourier (Grenoble), 49 (2), pp. 673-685
Cenzer, D., Dashti, S.A., King, J.L.F., Computable symbolic dynamics (2008) Math. Log. Q., 54 (5), pp. 460-469
Chalopin, J., Ochem, P., Dejean’s conjecture and letter frequency (2008) RAIRO Theor. Inform. Appl., 42 (3), pp. 477-480
Champernowne, D.G., The construction of decimals normal in the scale of ten (1933) J. Lond. Math. Soc, 254-260
Chan, D.H.Y., Hare, K.G., A multi-dimensional analogue of Cobham’s theorem for fractals (2014) Proc. Am. Math. Soc., 142 (2), pp. 449-456
Charlier, É., Kärki, T., Rigo, M., Multidimensional generalized automatic sequences and shape-symmetric morphic words (2010) Discret. Math., 310 (6-7), pp. 1238-1252
Charlier, É., Lacroix, A., Rampersad, N., Multi-dimensional sets recognizable in all abstract numeration systems (2012) RAIRO Theor. Inform. Appl., 46 (1), pp. 51-65
Charlier, É., Leroy, J., Rigo, M., An analogue of Cobham’s theorem for graph directed iterated function systems (2015) Adv. Math., 280, pp. 86-120
Charlier, É., Leroy, J., Rigo, M., Asymptotic properties of free monoid morphisms (2016) Linear Algebra Appl, 500, pp. 119-148
Charlier, É., Rampersad, N., The growth function of S-recognizable sets (2011) Theor. Comput. Sci., 412 (39), pp. 5400-5408
Charlier, É., Rampersad, N., Shallit, J., Enumeration and decidable properties of automatic sequences (2012) Int. J. Found. Comput. Sci., 23 (5), pp. 1035-1066
Charlier, É., Rigo, M., Steiner, W., Abstract numeration systems on bounded languages and multiplication by a constant (2008) Integers, 8 (A35), p. 19
Choffrut, C., Karhumäki, J., Combinatorics of words (1997) Handbook of Formal Languages, 1, pp. 329-438. , Rozenberg, G., Salomaa, A. (eds.), Springer, New York
Chou, C., Elementary amenable groups (1980) Ill. J. Math., 24 (3), pp. 396-407
Clark, R.J., (2001) Avoidable Formulas in Combinatorics on Words, , Ph.D. thesis, University of California, Los Angeles
Clark, R.J., The existence of a pattern which is 5-avoidable but 4-unavoidable (2006) Int. J. Algebra Comput., 16 (2), pp. 351-367
Cobham, A., On the Hartmanis-Stearns problem for a class of tag machines (1968) IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, pp. 51-60. , Also appeared as IBM Research Technical Report RC-2178, August 23
Cobham, A., On the base-dependence of sets of numbers recognizable by finite automata (1969) Math. Syst. Theory, 3, pp. 186-192
Cobham, A., Uniform tag sequences (1972) Math. Syst. Theory, 6, pp. 164-192
Cohen, D.B., The large scale geometry of strongly aperiodic subshifts of finite type (2017) Adv. Math., 308, pp. 599-626
Cohen, J.M., Cogrowth and amenability of discrete groups (1982) J. Funct. Anal., 48 (3), pp. 301-309
Cohen, P.J., Factorization in group algebras (1959) Duke Math. J., 26, pp. 199-205
Connes, A., Classification of injective factors cases ii1
ii∞
iiiλ
λ=≠ 1 (1976) Ann. Math., 104 (2), pp. 73-115
Connes, A., Feldman, J., Weiss, B., An amenable equivalence relation is generated by a single transformation (1981) Ergodic Theory Dyn. Syst., 1 (4), pp. 431-450
Conway, J.H., (1976) On Numbers and Games, , Academic Press, New York
Coons, M., Regular sequences and the joint spectral radius (2017) Int. J. Found. Comput. Sci., 28 (2), pp. 135-140
Coons, M., Zero order estimate for Mahler functions (2016) N. Z. J. Math., 46, pp. 83-88
Coons, M., Tyler, J., The maximal order of Stern’s diatomic sequence (2014) Mosc. J. Comb. Number Theory, 4 (3), pp. 3-14
Copeland, A.H., Erdős, P., Note on normal numbers (1946) Bull. Am. Math. Soc., 52, pp. 857-860
Cornfeld, I.P., Fomin, S.V., Sinaĭ, Y.G., Ergodic Theory, , Springer, New York (1982). Translated from the Russian by A.B. Sosinskiĭ
Coulhon, T., Saloff-Coste, L., Isopérimétrie pour les groupes et les variétés (1993) Rev. Mat. Iberoamericana, 9 (2), pp. 293-314
Coutinho, S.C., McConnell, J.C., The quest for quotient rings (Of noncommutative noetherian rings) (2003) Am. Math. Mon., 110 (4), pp. 298-313
Culik, K., An aperiodic set of 13 Wang tiles (1996) Discret. Math., 160, pp. 245-251
Culik, K., Pachl, J.K., Yu, S., On the limit sets of cellular automata (1989) SIAM J. Comput, 18 (4), pp. 831-842
Currie, J.D., The number of binary words avoiding abelian fourth powers grows exponentially (2004) Theor. Comput. Sci., 319 (1), pp. 441-446
Currie, J.D., Rampersad, N., Fixed points avoiding abelian k-powers (2012) J. Comb. Theory Ser. A, 119 (5), pp. 942-948
Currie, J.D., Visentin, T.I., Long binary patterns are abelian 2-avoidable (2008) Theor. Comput. Sci., 409 (3), pp. 432-437
Dai, J., Lathrop, J., Lutz, J., Mayordomo, E., Finite-state dimension (2004) Theor. Comput. Sci., 310, pp. 1-33
Dajani, K., Kraaikamp, C., Ergodic Theory of Numbers (2002) Carus Mathematical Monographs, 29. , Mathematical Association of America, Washington, DC
D’Angeli, D., Godin, T., Klimann, I., Picantin, M., Rodaro, E., Boundary Action of Automaton Groups without Singular Points and Wang Tilings (2016)
D’Angeli, D., Rodaro, E., A geometric approach to (Semi)-groups defined by automata via dual transducers (2015) Geom. Dedicata, pp. 375-400
Daubechies, I., Lagarias, J.C., Sets of matrices all infinite products of which converge (1992) Linear Algebra Appl, 161, pp. 227-263
Davenport, H., Erdős, P., Note on normal decimals (1952) Can. J. Math., 4, pp. 58-63
Day, M.M., Amenable semigroups (1957) Ill. J. Math., 1, pp. 509-544
de Bruijn, N.G., A combinatorial problem (1946) Proc. Konin. Neder. Akad. Wet., 49, pp. 758-764
de La Harpe, P., (2000) Topics in Geometric Group Theory, , University of Chicago Press, Chicago, IL
Dehornoy, P., Garside and quadratic normalisation: A survey (2015) 19Th International Conference on Developments in Language Theory (DLT 2015). Lecture Notes in Computer Science, 9168, pp. 14-45
Dehornoy, P., Guiraud, Y., Quadratic normalization in monoids (2016) Int. J. Algebra Comput., 26 (5), pp. 935-972
Dehornoy, P., Foundations of Garside theory (2015) Eur. Math. Soc. Tracts in Mathematics, 22. , http://www.math.unicaen.fr/garside/Garside.pdf
Dejean, F., Sur un théorème de Thue (1972) J. Comb. Theory Ser. A, 13 (1), pp. 90-99
Dekking, F.M., Strongly non-repetitive sequences and progression-free sets (1979) J. Comb. Theory Ser. A, 27 (2), pp. 181-185
Dekking, F.M., Mendès France, M., Poorten, A.J.V.D., (1982) Folds! Math. Intelligencer, 4, pp. 130-138. , Erratum, 5 (1983), 5
Delacourt, M., Ollinger, N., Permutive one-way cellular automata and the finiteness problem for automaton groups (2017) 13Th Conference on Computability in Europe (Cie 2017). Lecture Notes in Computer Science, 10307, pp. 234-245
Delange, H., Sur la fonction sommatoire de la fonction “somme des chiffres” (1975) Enseign. Math., 21, pp. 31-47
Delvenne, J.C., Kůrka, P., Blondel, V.D., (2005) Computational Universality in Symbolic Dynamical Systems, pp. 104-115. , Springer, Berlin/Heidelberg
Denker, M., Grillenberger, C., Sigmund, K., (1976) Ergodic Theory on Compact Spaces. Lecture Notes in Mathematics, 527. , Springer, Berlin
Derriennic, Y., Lois “zéro ou deux” pour les processus de Markov. Applications aux marches aléatoires (1976) Ann. Inst. H. Poincaré Sect. B (N.S.), 12 (2), pp. 111-129
Derriennic, Y., Quelques applications du théorème ergodique sous-additif (1980) Conference on Random Walks, Kleebach, 1979. Astérisque, 74, pp. 183-201. , 4. Soc. Math. France, Paris
Diestel, R., A short proof of Halin’s grid theorem (2004) Abh. Math. Semin. Univ. Hambg., 74, pp. 237-242
Dixmier, J., (1950) Les Moyennes Invariantes Dans Les Semi-Groups Et Leurs Applications, pp. 213-227. , Acta Sci. Math. Szeged 12(Leopoldo Fejer et Frederico Riesz LXX annos natis dedicatus, Pars A)
Downey, R.G., Hirschfeldt, D., (2010) Algorithmic Randomness and Complexity. Theory and Applications of Computability, 26, p. 855. , Springer, New York, NY
Drmota, M., Tichy, R.F., Sequences, Discrepancies, and Applications (1997) Lecture Notes in Mathematics, 1651. , Springer, Berlin
Dumas, P., (1993) Récurrences mahlériennes, Suites Automatiques, études Asymptotiques. Institut National De Recherche En Informatique Et En Automatique (INRIA), , Rocquencourt (1993). Thèse, Université de Bordeaux I, Talence
Dumas, P., Joint spectral radius, dilation equations, and asymptotic behavior of radix-rational sequences (2013) Linear Algebra Appl, 438 (5), pp. 2107-2126
Dumas, P., Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: Algebraic and analytic approaches collated (2014) Theor. Comput. Sci., 548, pp. 25-53
Durand, B., Romashchenko, A., Shen, A., (2010) Effective Closed Subshifts in 1D Can Be Implemented in 2D, pp. 208-226. , Springer, Berlin/Heidelberg
Durand, F., Combinatorics on Bratteli diagrams and dynamical systems (2010) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and Its Applications, 135, pp. 324-372. , Cambridge University Press, Cambridge
Durand, F., Host, B., Skau, C., Substitutional dynamical systems, Bratteli diagrams and dimension groups (1999) Ergodic Theory Dyn. Syst., 19 (4), pp. 953-993
Durand, F., Rigo, M., On Cobham’s theorem. In: Handbook of Automata European Mathematical Society Publishing House
Dye, H.A., On groups of measure preserving transformation. I (1959) Am. J. Math., 81, pp. 119-159
Edgar, G., (2008) Measure, Topology, and Fractal Geometry, , 2nd edn. Undergraduate Texts in Mathematics. Springer, New York
Edlin, A.E., The number of binary cube-free words of length up to 47 and their numerical analysis (1999) J. Differ. Equ. Appl, 5 (4-5), pp. 353-354
Eggleston, H.G., The fractional dimension of a set defined by decimal properties (1949) Q. J. Math. Oxford Ser., 20, pp. 31-36
Eilenberg, S., (1974) Automata, Languages, and Machines, , Academic Press, New York
Elek, G., Monod, N., On the topological full group of a minimal cantor Z2 -system (2013) Proc. Am. Math. Soc., 141 (10), pp. 3549-3552
Elekes, M., Keleti, T., Máthé, A., Self-similar and self-affine sets: Measure of the intersection of two copies (2010) Ergodic Theory Dyn. Syst., 30 (2), pp. 399-440
Entringer, R.C., Jackson, D.E., Schatz, J.A., On nonrepetitive sequences (1974) J. Comb. Theory Ser. A, 16 (2), pp. 159-164
Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P., (1992) Word Processing in Groups, , Jones and Bartlett Publishers, Boston, MA
Erdős, P., Some unsolved problems (1957) Mich. Math. J., 4 (3), pp. 291-300
Erdős, P., Some unsolved problems (1961) Magyar Tud. Akad. Mat. Kutató Int. Közl., 6, pp. 221-254
Erschler, A.G., (2010) Poisson-Furstenberg Boundaries, Large-Scale Geometry and Growth of Groups, 2, pp. 681-704. , Proc. ICM Hyderabad, India
Evdokimov, A.A., Strongly asymmetric sequences generated by a finite number of symbols (1968) Dokl. Akad. Nauk SSSR, 179, pp. 1268-1271
Feng, D.J., Wang, Y., On the structures of generating iterated function systems of Cantor sets (2009) Adv. Math., 222 (6), pp. 1964-1981
Ferrante, J., Rackoff, C., A decision procedure for the first order theory of real addition with order (1975) SIAM J. Comput., 4, pp. 69-76
Figueira, S., Nies, A., Feasible analysis, randomness, and base invariance (2015) Theory Comput. Syst., 56, pp. 439-464
Fiorenzi, F., Ochem, P., Vaslet, E., Bounds for the generalized repetition threshold (2011) Theor. Comput. Sci., 412 (27), pp. 2955-2963
Flajolet, P., Sedgewick, R., (2009) Analytic Combinatorics, , Cambridge University Press, Cambridge
Følner, E., Note on a generalization of a theorem of Bogolioùboff (1954) Math. Scand., 2, pp. 224-226
Følner, E., On groups with full Banach mean value (1955) Math. Scand., 3, pp. 243-254
Fraenkel, A.S., Systems of numeration (1985) Am. Math. Mon., 92, pp. 105-114
Fraenkel, A.S., Simpson, R.J., How many squares must a binary sequence contain? (1995) Electron. J. Comb., 2, p. 9
Frougny, C., Representations of numbers and finite automata (1992) Math. Syst. Theory, 25, pp. 37-60
Frougny, C., Pelantova, E., Beta-representations of 0 and Pisot numbers J. Théor. Nombres Bordeaux
Frougny, C., Sakarovitch, J., Number representation and finite automata (2010) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and Its Applications, 135, pp. 34-107. , Cambridge University Press, Cambridge
Frougny, C., Solomyak, B., On representation of integers in linear numeration systems (1996) Ergodic Theory of Zd Actions (Warwick, 1993–1994). London Mathematical Society Lecture Note Series, 228, pp. 345-368. , Pollicott, M., Schmidt, K. (eds.), Cambridge University Press, Cambridge
Fukuyama, K., The law of the iterated logarithm for discrepancies of fθnx} (2008) Acta Math. Hung., 118 (1), pp. 155-170
Furstenberg, H., A poisson formula for semi-simple lie groups (1963) Ann. Math., 77 (2), pp. 335-386
Furstenberg, H., Boundary theory and stochastic processes on homogeneous spaces (1972) Harmonic Analysis on Homogeneous Spaces, pp. 193-229. , Proceedings of Symposia in Pure Mathematics, vol. XXVI, Williams Coll., Williamstown, MA, American Mathematical Society, Providence, RI (1973)
Gál, S., Gál, L., The discrepancy of the sequence f.2nx/}. Koninklijke Nederlandse Akademie van Wetenschappen Proceedings (1964) Seres a 67 = Indagationes Mathematicae, 26, pp. 129-143
Gamard, G., Ochem, P., Richomme, G., Séébold, P., (2016) Avoidability of Circular Formulas
Gawron, P.W., Nekrashevych, V.V., Sushchansky, V.I., Conjugation in tree automorphism groups (2001) Int. J. Algebra Comput., 11 (5), pp. 529-547
Georgiadis, L., Goldberg, A.V., Tarjan, R.E., Werneck, R.F., (2009) An Experimental Study of Minimum Mean Cycle Algorithms, pp. 1-13
Ghys, É., Carrière, Y., Relations d’équivalence moyennables sur les groupes de Lie (1985) C. R. Acad. Sci. Paris Sér. I Math., 300 (19), pp. 677-680
Ghys, É., de La Harpe, P., Sur les groupes hyperboliques d’après Mikhael Gromov (1988) Progress in Mathematics, 83. , Birkhäuser, Boston, MA (1990). Papers from the Swiss Seminar on Hyperbolic Groups held in Bern
Gillibert, P., The finiteness problem for automaton semigroups is undecidable (2014) Int. J. Algebra Comput., 24 (1), pp. 1-9
Gillibert, P., (2017) Simulating Turing Machines with Invertible Mealy Automata
Glasner, S., (1976) Proximal Flows. Lecture Notes in Mathematics, 517. , Springer, Berlin/New York
Glasner, Y., Monod, N., Amenable actions, free products and a fixed point property (2007) Bull. Lond. Math. Soc., 39 (1), pp. 138-150
Glasner, Y., Mozes, S., Automata and square complexes (2005) Geom. Dedicata, 111, pp. 43-64
Gluškov, V., Abstract theory of automata (1961) Uspehi Mat. Nauk, 16 (5), pp. 3-62
Goč, D., Henshall, D., Shallit, J., Automatic theorem-proving in combinatorics on words (2013) Int. J. Found. Comput. Sci., 24 (6), pp. 781-798
Goč, D., Mousavi, H., Schaeffer, L., Shallit, J., A new approach to the paperfolding sequences (2015) Evolving Computability. Lecture Notes in Computer Science, 9136, pp. 34-43. , Springer, Cham
Goč, D., Mousavi, H., Shallit, J., On the number of unbordered factors (2013) Language and Automata Theory and Applications. Lecture Notes in Computer Science, 7810, pp. 299-310. , Springer, Heidelberg
Godin, T., Klimann, I., Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups (2016) 41St International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Lipics, 58, p. 44
Godin, T., Klimann, I., Picantin, M., On torsion-free semigroups generated by invertible reversible Mealy automata (2015) 9Th International Conference on Language and Automata Theory and Applications (LATA). Lecture Notes in Computer Science, 8977, pp. 328-339
Goldie, A.W., Semi-prime rings with maximum condition (1960) Proc. Lond. Math. Soc., 10 (3), pp. 201-220
Golod, E.S., On nil-algebras and finitely approximable p-groups (1964) Izv. Akad. Nauk SSSR Ser. Mat., 28, pp. 273-276. , English translation: Am. Math. Soc. Transl. 48, 108–111 (1965)
Golod, E.S., On nil-algebras and finitely residual groups (1964) Izv. Akad. Nauk SSSR. Ser. Mat., 28, pp. 273-276
Golod, E.S., Shafarevich, I., On the class field tower (1964) Izv. Akad. Nauk SSSR Ser. Mat., 28, pp. 261-272
Goodman-Strauss, C., Matching rules and substitution tilings (1998) Ann. Math., 147 (1), pp. 181-223
Goodman-Strauss, C., A hierarchical strongly aperiodic set of tiles in the hyperbolic plane (2010) Theor. Comput. Sci., 411 (7), pp. 1085-1093
Goodwyn, L.W., Topological entropy bounds measure-theoretic entropy (1969) Proc. Am. Math. Soc., 23, pp. 679-688
Gottschalk, W.H., Almost periodic points with respect to transformation semi-groups (1946) Ann. Math. (2), 47, pp. 762-766
Gouëzel, S., A numerical lower bound for the spectral radius of random walks on surface groups (2015) Comb. Probab. Comput., 24 (6), pp. 838-856
Gournay, A., (2014) The Liouville Property via Hilbertian Compression
Gournay, A., Amenability criteria and critical probabilities in percolation (2015) Expo. Math., 33 (1), pp. 108-115
Greenleaf, F.P., Amenable actions of locally compact groups (1969) J. Funct. Anal, 4, pp. 295-315
Greenleaf, F.P., Invariant Means on Topological Groups and Their Applications (1969) Van Nostrand Mathematical Studies, 16. , Van Nostrand, New York
Grigorchuk, R.I., On Burnside’s problem on periodic groups (1980) Funktsional. Anal. I Prilozhen., 14 (1), pp. 53-54
Grigorchuk, R.I., Symmetrical random walks on discrete groups (1980) Multicomponent Random Systems, pp. 285-325. , Dekker, New York
Grigorchuk, R.I., On the Milnor problem of group growth (1983) Dokl. Akad. Nauk SSSR, 271 (1), pp. 30-33
Grigorchuk, R.I., Degrees of growth of finitely generated groups and the theory of invariant means (1984) Izv. Akad. Nauk SSSR Ser. Mat., 48 (5), pp. 939-985
Grigorchuk, R.I., (2000) New Horizons in Pro-P Groups, Chap. Just Infinite Branch Groups, pp. 121-179. , Birkhäuser, Boston, MA
Grigorchuk, R.I., Nekrashevich, V.V., Sushchanskiĭ, V.I., Automata, dynamical systems, and groups (2000) Tr. Mat. Inst. Steklova, 231, pp. 134-214
Grigorchuk, R.I., Nekrashevych, V.V., Amenable actions of non-amenable groups (2007) J. Math. Sci., 140 (3), pp. 391-397
Gromov, M., Entropy and isoperimetry for linear and non-linear group actions (2008) Groups Geom. Dyn., 2 (4), pp. 499-593
Gromov, M.L., Groups of polynomial growth and expanding maps (1981) Inst. Hautes Études Sci. Publ. Math., 53, pp. 53-73
Gromov, M.L., Endomorphisms of symbolic algebraic varieties (1999) J. Eur. Math. Soc. (JEMS), 1 (2), pp. 109-197
Gromov, M.L., Topological invariants of dynamical systems and spaces of holomorphic maps (1999) I.Math.Phys.Anal.Geom., 2 (4), pp. 323-415
Guégan, G., Ochem, P., A short proof that shuffle squares are 7-avoidable (2016) RAIRO Theor. Inform. Appl., 50 (1), pp. 101-103
Guivarch, Y., Groupes de Lie à croissance polynomiale (1970) C. R. Acad. Sci. Paris Sér. A-B, 271, pp. A237-A239
Hadamard, J., Théorème sur les séries entières (1899) Acta Math, 22, pp. 55-63
Häggström, O., Jonasson, J., Uniqueness and non-uniqueness in percolation theory (2006) Probab. Surv., 3, pp. 289-344
Hall, P., On representatives of subsets (1935) J. Lond. Math. Soc., 10, pp. 26-30
Hansel, G., A simple proof of the Skolem-Mahler-Lech theorem (1985) Proceedings of the 12Th International Conference on Automata, Languages, and Programming (ICALP). Lecture Notes in Computer Science, 194, pp. 244-249. , Brauer, W. (ed.), Springer, Berlin
Hardy, G.H., Wright, E.M., (1985) An Introduction to the Theory of Numbers, , edn. Oxford University Press, Oxford
Hare, K.G., Morris, I.D., Sidorov, N., Theys, J., An explicit counterexample to the Lagarias-Wang finiteness conjecture (2011) Adv. Math., 226 (6), pp. 4667-4701
Hartmanis, J., Stearns, R.E., On the computational complexity of algorithms (1965) Trans. Am. Math. Soc., 117, pp. 285-306
Hausdorff, F., Bemerkung über den Inhalt von Punktmengen (1914) Math. Ann., 75 (3), pp. 428-433
Hedlund, G., Morse, M., Symbolic dynamics (1938) Am. J. Math., 60 (4), pp. 815-866
Hedlund, G.A., Endormorphisms and automorphisms of the shift dynamical system (1969) Math. Syst. Theory, 3, pp. 320-375
Herman, R.H., Putnam, I.F., Skau, C.F., Ordered Bratteli diagrams, dimension groups and topological dynamics (1992) Int. J. Math., 3 (6), pp. 827-864
Hindman, N., Finite sums of sequences within cells of a partition of N (1974) J. Comb. Theory. Ser. A, 17, pp. 1-11
Hindman, N., Partitions and sums of integers with repetition (1979) J. Comb. Theory. Ser. A, 27, pp. 19-32
Hindman, N., Leader, I., Strauss, D., Pairwise sums in colourings of the reals (2016) Abh. Math. Semin. Univ. Hambg., pp. 1-13
Hindman, N., Strauss, D., (2012) Algebra in the Stone-Čech Compactification: Theory and Applications, , Walter de Gruyter, Berlin
Hochman, M., On the dynamics and recursive properties of multidimensional symbolic systems (2009) Invent. Math., 176 (1), pp. 131-167
Hochman, M., Meyerovitch, T., A characterization of the entropies of multidimensional shifts of finite type (2010) Ann. Math. (2), 171 (3), pp. 2011-2038
Hoffmann, M., (2001) Automatic Semigroups, , Ph.D. thesis, Univ Leicester
Hollander, M., Greedy numeration systems and regularity (1998) Theory Comput. Syst., 31, pp. 111-133
Honkala, J., On the simplification of infinite morphic words (2009) Theor. Comput. Sci., 410 (8-10), pp. 997-1000
Hooper, P.K., The undecidability of the Turing machine immortality problem (1966) J. Symb. Log., 31 (2), pp. 219-234
Hopcroft, J.E., Motwani, R., Ullman, J.D., (2006) Introduction to Automata Theory, Languages, and Computation, 3Rd Edn, , Addison-Wesley, Boston
Hopcroft, J.E., Ullman, J.D., (1979) Introduction to Automata Theory, Languages, and Computation, , Addison-Wesley, Boston
Hughes, B., Trees and ultrametric spaces: A categorical equivalence (2004) Adv. Math., 189 (1), pp. 148-191
Hulanicki, A., Means and Følner condition on locally compact groups (1966) Stud. Math., 27, pp. 87-104
Huova, M., Karhumki, J., Saarela, A., Problems in between words and abelian words: K-abelian avoidability (2012) Theor. Comput. Sci., 454, pp. 172-177
Hurwitz, A., (1919) Vorlesungen über Die Zahlentheorie Der Quaternionen, , Springer, Berlin
Hutchinson, J.E., Fractals and self-similarity (1981) Indiana Univ. Math. J., 30 (5), pp. 713-747
Hyde, J., Laschos, V., Olsen, L., Petrykiewicz, I., Shaw, A., Iterated Cesàro averages, frequencies of digits, and Baire category (2010) Acta Arith, 144 (3), pp. 287-293
Ilie, L., Ochem, P., Shallit, J., A generalization of repetition threshold (2005) Theor. Comput. Sci., 345 (2), pp. 359-369
Jeandel, E., (2015) Aperiodic Subshifts on Polycyclic Groups
Jeandel, E., Translation-Like Actions and Aperiodic Subshifts on Groups (2015)
Jeandel, E., Rao, M., (2015) An Aperiodic Set of 11 Wang Tiles
Jeandel, E., Vanier, P., Characterizations of periods of multi-dimensional shifts (2015) Ergodic Theory Dyn. Syst., 35 (2), pp. 431-460
Johnson, B.E., Cohomology in Banach Algebras (1972) Memoirs of the American Mathematical Society, (127). , American Mathematical Society, Providence, RI
Jørgensen, T., A note on subgroups of sl.2
C/ (1977) Q. J. Math. Oxf. Ser., 28 (110), pp. 209-211
Jungers, R., The Joint Spectral Radius, Theory and Applications (2009) Lecture Notes in Control and Information Sciences, 385. , Springer, Berlin
Jungers, R.M., Blondel, V.D., On the finiteness property for rational matrices (2008) Linear Algebra Appl, 428 (10), pp. 2283-2295
Juschenko, K., (2015) Amenability of Discrete Groups by Examples
Juschenko, K., Monod, N., Cantor systems, piecewise translations and simple amenable groups (2013) Ann. Math., 178 (2), pp. 775-787
Juschenko, K., Zhang, T., (2016) Infinitely Supported Liouville Measures of Schreier Graphs
Juschenko, K., Matte Bon, N., Monod, N., de La Salle, M., (2015) Extensive Amenability and an Application to Interval Exchanges
Juschenko, K., Nekrashevych, V., de La Salle, M., Extensions of amenable groups by recurrent groupoids (2016) Invent. Math., 206 (3), pp. 837-867
Kahr, A., Moore, E.F., Wang, H., Entscheidungsproblem reduced to the ∀Ǝ∀ case (1962) Proc. Natl. Acad. Sci. U. S. A., 48 (3), pp. 365-377
Kaimanovich, V.A., Amenability, hyperfiniteness, and isoperimetric inequalities (1997) C. R. Acad. Sci. Paris Sér. I Math., 325 (9), pp. 999-1004
Kaimanovich, V.A., (2016) Thompson’s Group F is Not Liouville
Kaimanovich, V.A., Vershik, A.M., Random walks on discrete groups: Boundary and entropy (1983) Ann. Probab., 11 (3), pp. 457-490
Kakutani, S., Two fixed-point theorems concerning bicompact convex sets (1938) Proc. Imp. Acad., 14 (7), pp. 242-245
Kaplansky, I., (1957) Problems in the Theory of Rings. Report of a Conference on Linear Algebras, pp. 1-3. , National Academy of Sciences-National Research Council, Washington, Publ. 502
Kaplansky, I., Problems in the theory of rings” revisited (1970) Am. Math. Mon., 77, pp. 445-454
Karhumäki, J., Generalized Parikh mappings and homomorphisms (1980) Inf. Control, 47 (3), pp. 155-165
Karhumäki, J., Saarela, A., Zamboni, L.Q., On a generalization of Abelian equivalence and complexity of infinite words (2013) J. Comb. Theory Ser. A, 120 (8), pp. 2189-2206
Karhumäki, J., Shallit, J., Polynomial versus exponential growth in repetition-free binary words (2004) J. Comb. Theory Ser. A, 105 (2), pp. 335-347
Kari, J., The nilpotency problem of one-dimensional cellular automata (1992) SIAM J. Comput., 21 (3), pp. 571-586
Kari, J., A small aperiodic set of Wang tiles (1996) Discret. Math., 160, pp. 259-264
Kari, J., (2007) The Tiling Problem Revisited, pp. 72-79. , MCU
Kari, J., On the undecidability of the tiling problem (2008) Current Trends in Theory and Practice of Computer Science (SOFSEM), pp. 74-82
Kari, J., Ollinger, N., Periodicity and immortality in reversible computing (2008) 33Rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), 5162, pp. 419-430
Karp, R., A characterization of the minimum mean cycle in a digraph (1978) Discret. Math., 23, pp. 309-311
Kaufman, R., On the theorem of Jarník and Besicovitch (1981) Acta Arith, 39 (3), pp. 265-267
Každan, D.A., On the connection of the dual space of a group with the structure of its closed subgroups (1967) Funkcional. Anal. I Priložen., 1, pp. 71-74
Keane, M., Interval exchange transformations (1975) Math. Z., 141, pp. 25-31
Kelley, J.L., The Tychonoff product theorem implies the axiom of choice (1950) Fundam. Math., 37, pp. 75-76
Keränen, V., Abelian squares are avoidable on 4 letters (1992) ICALP, pp. 41-52
Keränen, V., (2003) New Abelian Square-Free Dt0l-Languages over 4 Letters
Keränen, V., A powerful abelian square-free substitution over 4 letters (2009) Theor. Comput. Sci., 410 (38), pp. 3893-3900
Kesten, H., Symmetric random walks on groups (1959) Trans. Am. Math. Soc., 92, pp. 336-354
Khalyavin, A., The minimal density of a letter in an infinite ternary square-free word is 883/3215 (2007) J. Integer Seq., 10
Khintchine, A., Einige sätze über kettenbrüche, mit anwendungen auf die theorie der diophantischen approximationen (1924) Math. Ann., 92 (1), pp. 115-125
Kitchens, B.P., (1998) Symbolic Dynamics, One-Sided, Two-Sided and Countable State Markov Shifts, , Universitext. Springer, Berlin
Kleene, S.C., Representation of events in nerve nets and finite automata (1956) Automata Studies, pp. 3-42. , Princeton University Press, Princeton
Kleiner, B., A new proof of Gromov’s theorem on groups of polynomial growth (2010) J. Am. Math. Soc., 23 (3), pp. 815-829
Klimann, I., Automaton semigroups: The two-state case (2014) Theory Comput. Syst., pp. 1-17
Klimann, I., On level-transitivity and exponential growth (2016) Semigroup Forum, pp. 1-7
Klimann, I., Picantin, M., Savchuk, D., A connected 3-state reversible Mealy automaton cannot generate an infinite burnside group (2015) 19Th International Conference on Developments in Language Theory (DLT). Lecture Notes in Computer Science, 9168, pp. 313-325
Klimann, I., Picantin, M., Savchuk, D., Orbit automata as a new tool to attack the order problem in automaton groups (2016) J. Algebra, 445, pp. 433-457
Koiran, P., Cosnard, M., Garzon, M., Computability with low-dimensional dynamical systems (1994) Theor. Comput. Sci., 132 (1), pp. 113-128
Kolpakov, R., Efficient lower bounds on the number of repetition-free words (2007) J. Integer Seq., 10
Kolpakov, R., Kucherov, G., Tarannikov, Y., On repetition-free binary words of minimal density (1999) Theor. Comput. Sci., 218, pp. 161-175
Kolpakov, R., Rao, M., On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (2011) Theor. Comput. Sci., 412 (46), pp. 6507-6516
Korobov, A.N., Continued fractions of certain normal numbers (1990) Mat. Z., 47 (2), pp. 28-33. , English translation in Math. Notes Acad. Sci. USSR 47, 128–132 (1990)
Kozyakin, V.S., A dynamical systems construction of a counterexample to the finiteness conjecture (2005) Proceedings of the 44Th IEEE Conference on Decision and Control, pp. 2338-2343. , European Control Conference
Kraaikamp, C., Nakada, H., On normal numbers for continued fractions (2000) Ergodic Theory Dyn. Syst., 20 (5), pp. 1405-1421
Krieger, F., Le lemme d’Ornstein-Weiss d’après Gromov (2007) Dynamics, Ergodic Theory, and Geometry. Mathematical Sciences Research Institute Publications, 54, pp. 99-111. , Cambridge University Press, Cambridge
Kucherov, G., Ochem, P., Rao, M., How many square occurrences must a binary sequence contain? (2003) Electron. J. Comb., 10 (1), p. 12
Kuipers, L., Niederreiter, H., (2006) Uniform Distribution of Sequences, , Dover, Mineola
Kurka, P., On topological dynamics of Turing machines (1997) Theor. Comput. Sci., 174, pp. 203-216
Kuske, D., Lohrey, M., Logical aspects of Cayley-graphs: The group case (2005) Ann. Pure Appl. Logic, 131 (1-3), pp. 263-286
Lagarias, J.C., Wang, Y., The finiteness conjecture for the generalized spectral radius of a set of matrices (1995) Linear Algebra Appl, 214, pp. 17-42
Lam, T.Y., Lectures on Modules and Rings (1999) Graduate Texts in Mathematics, 189. , Springer, New York
Lansing, J., Distribution of values of the binomial coefficients and the Stern sequence (2013) J. Integer Seq., 16 (3), p. 10
Le Gloannec, B., (2014) The 4-Way Deterministic Periodic Domino Problem is Undecidable, , HAL:00985482
Lebesgue, H., Sur certains démonstrations d’existence (1917) Bull. Soc. Math. France, 45, pp. 127-132
Lecomte, P.B.A., Rigo, M., Numeration systems on a regular language (2001) Theory Comput. Syst., 34, pp. 27-44
Lennox, J.C., Robinson, D.J., (2004) The Theory of Infinite Soluble Groups. Oxford Mathematical Monographs, , Oxford Science Publications, Oxford
Leroux, J., A polynomial time Presburger criterion and synthesis for number decision diagrams (2005) Proceedings of the 20Th IEEE Symposium on Logic in Computer Science (LICS 2005, pp. 147-156. , IEEE Computer Society
Levin, M., On absolutely normal numbers. Vestnik Moscov. Univ. ser. I, Mat-Meh 1, 31–37, 87 (1979). English translation in Moscow Univ (1979) Math. Bull, 34 (1), pp. 32-39
Levin, M., On the discrepancy estimate of normal numbers (1999) Acta Arith. Warzawa, 88, pp. 99-111
Levy, P., Sur les lois de probabilité dont dependent les quotients complets et incomplets d’une fraction continue (1929) Bull. Soc. Math. France, 57, pp. 178-194
Lewis, J.T., Pfister, C.E., Russell, R.P., Sullivan, W.G., Reconstruction sequences and equipartition measures: An examination of the asymptotic equipartition property (1997) IEEE Trans. Inform. Theory, 43 (6), pp. 1935-1947
Lewis, J.T., Pfister, C.E., Sullivan, W.G., Large deviations and the thermodynamic formalism: A new proof of the equivalence of ensembles (1994) On Three Levels: Micro-, Meso-, and Macro-Approaches in Physics, pp. 183-192. , Fannes, M., Maes, C., Verbeure, A. (eds.), Springer US, Boston, MA
Liao, L., Ma, J., Wang, B., Dimension of some non-normal continued fraction sets (2008) Math. Proc. Camb. Philos. Soc., 145 (1), pp. 215-225
Lind, D., Marcus, B., (1995) An Introduction to Symbolic Dynamics and Coding, , Cambridge University Press, Cambridge
Lodha, Y., (2016) An Upper Bound for the Tarski Numbers of Non Amenable Groups of Piecewise Projective Homeomorphisms
Lodha, Y., Moore, J.T., A nonamenable finitely presented group of piecewise projective homeomorphisms (2016) Groups Geom. Dyn., 10 (1), pp. 177-200
Löding, C., Efficient minimization of deterministic weak ω-automata (2001) Inform. Process. Lett., 79 (3), pp. 105-109
Lothaire, M., (1983) Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, 17. , Addison-Wesley, Reading
Lothaire, M., (2002) Algebraic Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, 90. , Cambridge University Press, Cambridge
Lothaire, M., Applied Combinatorics on Words (2005) Encyclopedia of Mathematics and Its Applications, 105. , Cambridge University Press, Cambridge
Loxton, J.H., A method of Mahler in transcendence theory and some of its applications (1984) Bull. Aust. Math. Soc., 29 (1), pp. 127-136
Loxton, J.H., van Der Poorten, A.J., Arithmetic properties of automata: Regular sequences (1988) J. Reine Angew. Math., 392, pp. 57-69
de Luca, A., Pribavkina, E., Zamboni, L., A coloring problem for infinite words (2014) J. Comb. Theory. Ser. A, 125, pp. 306-332
de Luca, A., Varricchio, S., On the factors of the Thue-Morse word on three symbols (1988) Inf. Process. Lett., 27, pp. 281-285
de Luca, A., Zamboni, L., On prefixal factorisations of words (2016) Eur. J. Comb., 52, pp. 59-73
de Luca, A., Zamboni, L., On some variations of coloring problems of infinite words (2016) J. Comb. Theory. Ser. A, 137, pp. 166-178
Lüroth, J., Ueber eine eindeutige Entwickelung von Zahlen in eine unendliche Reihe (1883) Math. Ann., 21 (3), pp. 411-423
Lutz, J., Mayordomo, E., (2016) Computing Absolutely Normal Numbers in Nearly Linear Time
Machì, A., Mignosi, F., Garden of Eden configurations for cellular automata on Cayley graphs of groups (1993) SIAM J. Discret. Math., 6 (1), pp. 44-56
Madritsch, M., Scheerer, A.M., Tichy, R., Computable Absolutely Pisot Normal Numbers. Acta Aritmetica (2017, to Appear)
Madritsch, M.G., Non-normal numbers with respect to Markov partitions (2014) Discret. Contin. Dyn. Syst., 34 (2), pp. 663-676
Madritsch, M.G., Mance, B., Construction of μ-normal sequences (2016) Monatsh. Math, 179 (2), pp. 259-280
Madritsch, M.G., Petrykiewicz, I., Non-normal numbers in dynamical systems fulfilling the specification property (2014) Discret. Contin. Dyn. Syst., 34 (11), pp. 4751-4764
Madritsch, M.G., Thuswaldner, J.M., Tichy, R.F., Normality of numbers generated by the values of entire functions (2008) J. Number Theory, 128 (5), pp. 1127-1145
Magnus, W., Karrass, A., Solitar, D., (1976) Combinatorial Group Theory, , 2nd rev. edn. Dover, Mineola
Mahler, K., Arithmetische Eigenschaften der Lösungen einer Klasse von Funktionalgleichun-gen (1929) Math. Ann., 101 (1), pp. 342-366
Mahler, K., Arithmetische Eigenschaften einer Klasse transzendental-transzendenter Funk-tionen (1930) Math. Z., 32 (1), pp. 545-585
Mahler, K., Uber das Verschwinden von Potenzreihen mehrerer Veränderlichen in speziellen Punktfolgen (1930) Math. Ann., 103 (1), pp. 573-587
Mahler, K., An unsolved problem on the powers of 3/2 (1968) J. Aust. Math. Soc., 8, pp. 313-321
Mahler, K., Remarks on a paper by W. Schwarz (1969) J. Number Theory, 1, pp. 512-521
Maler, O., Staiger, L., On syntactic congruences for ω-languages (1997) Theor. Comput. Sci., 183 (1), pp. 93-112
Mann, A., How Groups Grow (2012) Lecture Note Series, 395. , London Mathematical Society
Margulis, G.A., Discrete subgroups of semisimple Lie groups (1991) Ergebnisse Der Mathematik Und Ihrer Grenzgebiete, 17 (3). , Springer, Berlin
Markley, N.G., Paul, M.E., Matrix subshifts for Z˅ symbolic dynamics (1981) Proc. Lond. Math. Soc., 3 (43), pp. 251-272
Markov, A.A., Quelques théorèmes sur les ensembles abeliens (1936) C. R. (Dokl.) Acad. Sci. URSS, N. Ser., 1936 (1), pp. 311-313
Marsault, V., Sakarovitch, J., Ultimate periodicity of b-recognisable sets: A quasilinear procedure (2013) Developments in Language Theory. Lecture Notes in Computer Science, 7907, pp. 362-373. , Springer, Heidelberg
McNaughton, R., Zalcstein, Y., The Burnside problem for semigroups (1975) J. Algebra, 34, pp. 292-299
Meyerovitch, T., Finite entropy for multidimensional cellular automata (2008) Ergodic Theory Dyn. Syst., 28 (4), pp. 1243-1260
Milchior, A., (2016) Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order
Milliken, K., Ramsey’s theorem with sums or unions (1975) J. Comb. Theory Ser. A, 18, pp. 276-290
Milnor, J., Growth of finitely generated solvable groups (1968) J. Differ. Geom., 2, pp. 447-449
Milnor, J., Problem 5603 (1968) Am. Math. Mon., 75 (6), pp. 685-686
Mirsky, L., Transversal Theory. An Account of Some Aspects of Combinatorial Mathematics (1971) Mathematics in Science and Engineering, 75. , Academic Press, New York
Monod, N., Groups of piecewise projective homeomorphisms (2013) Proc. Natl. Acad. Sci. U. S. A., 110 (12), pp. 4524-4527
Monod, N., Popa, S., On co-amenability for groups and von Neumann algebras (2003) C. R. Math. Acad. Sci. Soc. R. Can., 25 (3), pp. 82-87
Moore, E.F., Machine models of self-reproduction (1962) Mathematical Problems in the Biological Sciences. Proceedings of the Symposium in Applied Mathematics, 14, pp. 17-33. , American Mathematical Society, Providence, RI
Morris, D.W., Amenable groups that act on the line (2006) Algebr. Geom. Topol., 6, pp. 2509-2518
Moshe, Y., On some questions regarding k-regular and k-context-free sequences (2008) Theor. Comput. Sci., 400 (1-3), pp. 62-69
Mousavi, H., (2016) Automatic Theorem Proving in Walnut
Mousavi, H., Schaeffer, L., Shallit, J., Decision algorithms for Fibonacci-automatic words, I: Basic results (2016) RAIRO Theor. Inform. Appl., 50 (1), pp. 39-66
Mousavi, H., Shallit, J., Mechanical proofs of properties of the Tribonacci word (2015) Combinatorics on Words. Lecture Notes in Computer Science, 9304, pp. 170-190. , Springer, Cham
Mozes, S., Tilings, substitutions systems and dynamical systems generated by them (1989) J. Anal. Math., 53, pp. 139-186
Muchnik, R., Pak, I., Percolation on Grigorchuk Groups (2001) Commun. Algebra, 29 (2), pp. 661-671
Muller, D.E., Schupp, P.E., The theory of ends, pushdown automata, and second-order logic (1985) Theor. Comput. Sci., 37, pp. 51-75
Myers, D., Non recursive tilings of the plane II (1974) J. Symb. Log., 39 (2), pp. 286-294
Myhill, J., The converse of Moore’s Garden-of-Eden theorem (1963) Proc. Am. Math. Soc., 14, pp. 685-686
Nakada, H., Metrical theory for a class of continued fraction transformations and their natural extensions (1981) Tokyo J. Math., 4 (2), pp. 399-426
Nakai, Y., Shiokawa, I., A class of normal numbers (1990) Jpn. J. Math. (N.S.), 16 (1), pp. 17-29
Nakai, Y., Shiokawa, I., Discrepancy estimates for a class of normal numbers (1992) Acta Arith, 62 (3), pp. 271-284
Nakai, Y., Shiokawa, I., Normality of numbers generated by the values of polynomials at primes (1997) Acta Arith, 81, pp. 345-356
Naor, A., Peres, Y., Embeddings of discrete groups and the speed of random walks (2008) Int. Math. Res. Not. IMRN, p. 34. , Art. ID rnn 076
Nash-Williams, C.S.J.A., Random walk and electric currents in networks (1959) Proc. Camb. Philos. Soc., 55, pp. 181-194
Nasu, M., Textile Systems for Endomorphisms and Automorphisms of the Shift (1995) Memoirs of the American Mathematical Society, 114. , American Mathematical Society, Providence
Nekrashevych, V.V., Self-Similar Groups. Mathematical Surveys and Monographs (2005) American Mathematical Society, Providence, RI, 117
Nekrashevych, V.V., (2015) Simple Groups of Dynamical Origin
Nesterenko, Y.V., Estimate of the orders of the zeroes of functions of a certain class, and their application in the theory of transcendental numbers (1977) Izv. Akad. Nauk SSSR Ser. Mat., 41 (2), pp. 253-284
Nesterenko, Y.V., Algebraic independence of algebraic powers of algebraic numbers (1984) Mat. Sb. (N.S.), 123 (165), pp. 435-459
Nikishin, E.M., Sorokin, V.N., Rational approximations and orthogonality (1991) Translations of Mathematical Monographs, Vol. 92. American Mathematical Society, Providence, , Translated from the Russian by Ralph P. Boas
Nikodym, O., Sur une généralisation des intégrales de M. J. Radon (1930) Fundam. Math., 15, p. 358
Nishioka, K., Algebraic independence measures of the values of Mahler functions (1991) J. Reine Angew. Math., 420, pp. 203-214
Niven, I., Irrational Numbers (1963) MAA
Ochem, P., A generator of morphisms for infinite words (2006) RAIRO Theor. Inform. Appl., 40, pp. 427-441
Ochem, P., Letter frequency in infinite repetition-free words (2007) Theor. Comput. Sci., 380 (3), pp. 388-392
Ochem, P., Doubled patterns are 3-avoidable (2016) Electron. J. Comb., 23 (1)
Ochem, P., Reix, T., Upper bound on the number of ternary square-free words (2006) Workshop on Words and Automata
Ochem, P., Rosenfeld, M., (2016) Avoidability of Formulas with Two Variables
Odifreddi, P., Chapter {XIV} enumeration degrees (1999) Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, 143, pp. 827-861. , Elsevier, Amsterdam
Olshanskiĭ, A.Y., Infinite groups with cyclic subgroups (1979) Dokl. Akad. Nauk SSSR, 245 (4), pp. 785-787
Olshanskiĭ, A.Y., On the question of the existence of an invariant mean on a group (1980) Uspekhi Mat. Nauk, 35 (4), pp. 199-200
Olsen, L., Extremely non-normal continued fractions (2003) Acta Arith, 108 (2), pp. 191-202
Olsen, L., Multifractal analysis of divergence points of deformed measure theoretical Birkhoff averages (2003) J. Math. Pures Appl, 82 (12), pp. 1591-1649
Olsen, L., Extremely non-normal numbers (2004) Math. Proc. Camb. Philos. Soc., 137 (1), pp. 43-53
Olsen, L., Winter, S., Multifractal analysis of divergence points of deformed measure theoretical Birkhoff averages. II. Non-linearity, divergence points and Banach space valued spectra (2007) Bull. Sci. Math., 131 (6), pp. 518-558
Ore, Ø., Linear equations in non-commutative fields (1931) Ann. Math. (2), 32 (3), pp. 463-477
Ornstein, D.S., Weiss, B., Entropy and isomorphism theorems for actions of amenable groups (1987) J. Anal. Math, 48, pp. 1-141
Osin, D.V., Weakly amenable groups. In: Computational and Statistical Group Theory (Las Vegas, NV/Hoboken, NJ, 2001) (2002) Contemporary Mathematics, 298, pp. 105-113. , American Mathematical Society, Providence, RI
Owings, J., Problem e2494 (1974) Am. Math. Mon., 81
Ochem, P., Rao, M., Minimum frequencies of occurrences of squares and letters in infinite words (2008) Mons Days of Theoretical Computer Science, , Mons, August 27–30
Pansiot, J.J., Hiérarchie et fermeture de certaines classes de tag-systèmes (1983) Acta Inform, 20, pp. 179-196
Pansiot, J.J., Complexité des facteurs des mots infinis engendrés par morphismes itérés (1984) Proceedings of the 11Th International Conference on Automata, Languages, and Programming (ICALP). Lecture Notes in Computer Science, 172, pp. 380-389. , Paredaens, J. (ed.), Springer, Berlin
Pansiot, J.J., Subword complexities and iteration (1985) Bull. Eur. Assoc. Theor. Comput. Sci., 26, pp. 55-62
Parry, W., On the β-expansions of real numbers (1960) Acta Math. Acad. Sci. Hung., 11, pp. 401-416
Paschke, W.L., Lower bound for the norm of a vertex-transitive graph (1993) Math. Z., 213 (2), pp. 225-239
Passman, D.S., (1977) The Algebraic Structure of Group Rings. Pure and Applied Mathematics, , Wiley-Interscience, New York
Pavlov, R., On intrinsic ergodicity and weakenings of the specification property (2016) Adv. Math., 295, pp. 250-270
Pavlov, R., Schraudner, M., Classification of sofic projective subdynamics of multidimensional shifts of finite type (2015) Trans. Am. Math. Soc., 367, pp. 3371-3421
Peres, Y., Zheng, T., (2016) On Groups, Slow Heat Kernel Decay Yields Liouville Property and Sharp Entropy Bounds
Perrin, D., Symbolic dynamics and finite automata (1995) Proceedings of the 20Th Symposium, Mathematical Foundations of Computer Science 1995. Lecture Notes in Computer Science, 969, pp. 94-104. , Wiedermann, J., Hájek, P. (eds.), Springer, Berlin
Perrin, D., Pin, J.E., (2004) Infinite Words. Automata, Semigroups, Logic and Games, , Else-vier/Academic Press, Amsterdam
Pete, G., (2015) Probability and Geometry on Groups, , Book in progress
Pfister, C.E., Sullivan, W.G., Billingsley dimension on shift spaces (2003) Nonlinearity, 16 (2), pp. 661-682
Pfister, C.E., Sullivan, W.G., On the topological entropy of saturated sets (2007) Ergodic Theory Dyn. Syst., 27 (3), pp. 929-956
Philipp, W., Limit theorems for lacunary series and uniform distribution mod 1 (1975) Acta Arith, 26 (3), pp. 241-251
Piatetski-Shapiro, I.I., On the distribution of the fractional parts of the exponential function (1957) Moskov. Gos. Ped. Inst. Uč. Zap., 108, pp. 317-322
Picantin, M., (2016) Automatic Semigroups Vs Automaton Semigroups
Picantin, M., (2017) Automates, (Semi)Groupes, dualités. Habilitation à Diriger Des Recherches, , Univ. Paris Diderot
Pirillo, G., A proof of Shirshov’s theorem (1996) Adv. Math., 124 (1), pp. 94-99
Pirillo, G., Varricchio, S., On uniformly repetitive semigroups (1994) Semigroup Forum, 49 (1), pp. 125-129
Pleasants, P.A.B., Non-repetitive sequences (1970) Math. Proc. Camb. Philos. Soc., 68, pp. 267-274
Pytheas Fogg, N., Substitutions in Dynamics, Arithmetics and Combinatorics (2002) Lecture Notes in Mathematics, 1794. , Berthé, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.), Springer, Berlin
Queffélec, M., Substitution Dynamical Systems—Spectral Analysis (1987) Lecture Notes in Mathematics, 1294. , Springer, Berlin
Rabin, M.O., Scott, D., Finite automata and their decision problems (1959) IBM J. Res. Dev, 3, pp. 115-125
Rado, R., Note on the transfinite case of Hall’s theorem on representatives (1967) J. Lond. Math. Soc., 42, pp. 321-324
Ramsey, F.P., On a problem of formal logic (1930) Proc. Lond. Math. Soc., 30, pp. 264-286
Randé, B., (1992) Équations Fonctionnelles De Mahler Et Applications Aux Suites p-régulières. Institut National De Recherche En Informatique Et En Automatique (INRIA), , Rocquencourt (1992). Thèse, Université de Bordeaux I, Talence
Rao, M., Last cases of dejeans conjecture (2011) Theor. Comput. Sci., 412 (27), pp. 3010-3018
Rao, M., On some generalizations of abelian power avoidability (2015) Theor. Comput. Sci., 601, pp. 39-46
Rao, M., Rigo, M., Salimov, P., Avoiding 2-binomial squares and cubes (2015) Theor. Comput. Sci., 572, pp. 83-91
Rao, M., Rosenfeld, M., Avoidability of long k-abelian repetitions (2016) Math. Comput., 85 (302), pp. 3051-3060
Rao, M., Rosenfeld, M., Avoiding two consecutive blocks of same size and same sum over Z2 (2016)