Combinatorics, Words and Symbolic Dynamics

No full text

Collective work published as editor or director (Books)

Berthé, Valérie; Rigo, Michel

2016 • Cambridge University Press, Cambridge, United Kingdom

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

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 :

combinatorics; symbolic dynamics; tilings

Abstract :

[en] Internationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics. They explain the important concepts, providing a clear exposition of some recent results, and emphasise the emerging connections between these different fields. Topics include combinatorics on words, pattern avoidance, graph theory, tilings and theory of computation, multidimensional subshifts, discrete dynamical systems, ergodic theory, numeration systems, dynamical arithmetics, automata theory and synchronised words, analytic combinatorics, continued fractions and probabilistic models. Each topic is presented in a way that links it to the main themes, but then they are also extended to repetitions in words, similarity relations, cellular automata, friezes and Dynkin diagrams. The book will appeal to graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, tilings and stringology. It will also interest biologists using text algorithms.

Disciplines :

Mathematics

Editor :

Berthé, Valérie

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

Language :

English

Title :

Combinatorics, Words and Symbolic Dynamics

Publication date :

2016

Publisher :

Cambridge University Press, Cambridge, United Kingdom

ISBN/EAN :

9781107077027

Collection name :

Encyclopedia of Math. and its Applications

Additional URL :

http://www.cambridge.org/gi/academic/subjects/mathematics/discrete-mathematics-information-theory-and-coding/combinatorics-words-and-symbolic-dynamics?format=HB

Available on ORBi :

since 16 February 2016

Statistics

Number of views

171 (12 by ULiège)

Number of downloads

0 (0 by ULiège)

More statistics

Scopus citations^®

Scopus citations^®
without self-citations

Bibliography

Aberkane, A., and Currie, J. 2009. A cyclic binary morphism avoiding Abelian fourth powers. Theoret. Comput. Sci., 410, 44-52.
Aberkane, A., Currie, J. D., and Rampersad, N. 2004. The number of ternary words avoiding abelian cubes grows exponentially. J. Integer Seq., 7(2), Article 04.2.7, 13.
Aberkane, A., Linek, V., and Mor, S. J. 2006. On the powers in the Thue-Morse word. Australasian J. Combinat., 35, 41-49.
Adamczewski, B., and Bugeaud, Y. 2007. On the complexity of algebraic numbers. I. Expansions in integer bases. Ann. of Math. (2), 165, 547-565.
Adamczewski, B., and Bugeaud, Y. 2010. Transcendence and Diophantine approximation. In: Berthé, V., and Rigo, M. (eds.), Combinatorics, Automata, and Number Theory. Encyclopedia of Mathematics and its Applications, vol. 135. Cambridge University Press.
Adler, R. L., and Marcus, B. 1979. Topological entropy and equivalence of dynamical systems. Mem. Amer. Math. Soc., 20(219), iv+84.
Adler, R. L., Goodwyn, L.W., and Weiss, B. 1977. Equivalence of topological Markov shifts. Israel J. Math., 27(1), 48-63.
Adler, R. L., Coppersmith, D., and Hassner, M. 1983. Algorithms for sliding block codes. IEEE Trans. Inform. Theory, IT-29, 5-22.
Agrawal, M., Kayal, N., and Saxena, N. 2004. PRIMES is in P. Ann. of Math. (2), 160, 781-793.
Akiyama, S., and Komornik, V. 2013. Discrete spectra and Pisot numbers. J. Number Theory, 133(2), 375-390.
Allouche, J.-P., and Cosnard, M. 2000. The Komornik-Loreti constant is transcendental. Amer. Math. Monthly, 107(5), 448-449.
Allouche, J.-P., and Shallit, J. O. 1999. The ubiquitous Prouhet-Thue-Morse sequence. Pages 1-16 of: Ding, C., Helleseth, T., and Niederreiter, H. (eds.), Sequences and Their Applications, Proceedings of SETA '98. Springer-Verlag.
Allouche, J.-P., and Shallit, J. 2003. Automatic Sequences. (Theory, applications, generalizations.) Cambridge University Press.
Allouche, J.-P., Currie, J. D., and Shallit, J. 1998. Extremal infinite overlap-free binary words. Electronic J. Combinatorics, 5.
Allouche, J.-P., Rampersad, N., and Shallit, J. 2009. Periodicity, repetitions, and orbits of an automatic sequence. Theoret. Comput. Sci., 410, 2795-2803.
Alon, N., and Spencer, J. 2000. The Probabilistic Method. Wiley.
Alon, N., Grytczuk, J., Haluszczak, M., and Riordan, O. 2002. Nonrepetitive colorings of graphs. Random Structures and Algorithms, 21, 336-346.
Anne, V., Zamboni, L. Q., and Zorca, I. 2005. Palindromes and pseudo-palindromes in episturmian and pseudo-episturmian infinite words. Pages 91-100 of: Brlek, S., and Reutenauer, C. (eds.), Proceedings of Words 2005. Publications du LACIM, vol. 36.
Apostolico, A., and Breslauer, D. 1997. Of periods, quasiperiods, repetitions and covers. Pages 236-248 of: Structures in Logic and Computer Science.
Apostolico, A., and Ehrenfeucht, A. 1993. Efficient detection of quasiperiodicities in strings. Theoret. Comput. Sci., 119(2), 247-265.
Apostolico, A., and Preparata, F. P. 1983. Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci., 22(3), 297-315.
Apostolico, A., Farach, M., and Iliopoulos, C. S. 1991. Optimal superprimitivity testing for strings. Inf. Process. Lett., 39(1), 17-20.
Arnold, V. I. 2003. Topology and statistics of formulae of arithmetics. Russian Math. Surveys, 58, 637-664.
Arnold, V. I. 2004. Arnold's Problems. Springer Phasis.
Arnoux, P., and Schmidt, T. 2009. Veech surfaces with nonperiodic directions in the trace field. Journal of Modern Dynamics (JMD), 4, 611-629.
Arnoux, P., and Schmidt, T. 2014. Commensurable continued fractions. Discrete and Continuous Dynamical Systems, 34(11), 4389-4418.
Arora, S., and Barak, B. 2009. Computational Complexity. (A modern approach.) Cambridge University Press.
Assem, I., and Dupont, G. 2011. Friezes and a construction of the Euclidean cluster variables. J. Pure Appl. Algebra, 215(10), 2322-2340.
Assem, I., and Reutenauer, C. 2012. Mutating seeds: types A and Ã. Ann.Math. Blaise Pascal, 19(1), 29-73.
Assem, I., Reutenauer, C., and Smith, D. 2010. Friezes. Adv. Math., 225(6), 3134-3165.
Aubrun, N., and Sablik, M. 2010. Simulation of effective subshifts by two-dimensional subshifts. Preprint.
Baatz, M., and Komornik, V. 2011. Unique expansions in integer bases with extended alphabets. Publ. Math. Debrecen, 79(3-4), 251-267.
Badkobeh, G. 2011. Fewest repetitions versus maximal-exponent powers in infinite binary words. Theoret. Comput. Sci., 412(48), 6625-6633.
Badkobeh, G., and Crochemore, M. 2010. Bounded number of squares in infinite repetitionconstrained binary words. Pages 161-166 of: Holub, J., and Zd'árek, J. (eds.), Prague Stringology Conference. Czech Technical University in Prague.
Badkobeh, G., and Crochemore, M. 2014. Maximal-exponent factors in strings. J. Comput. Syst. Sci. In press.
Badkobeh, G., Crochemore, M., and Rao, M. 2014. Finite repetition threshold for large alphabets. Theor. Inform. Appl., eFirst(8).
Baiocchi, C., and Komornik, V. 2007. Greedy and quasi-greedy expansions in non-integer bases. Manuscript available electronically at arXiv:0710.3001.
Baker, S., and Sidorov, N. 2013. Expansions in non-integer bases: lower order revisited. Manuscript available electronically at arXiv:1302.4302.
Baladi, V. 2000. Positive Transfer Operators and Decay of Correlations. Advanced Series in Nonlinear Dynamics, vol. 16. World Scientific Publishing Co., Inc., River Edge, NJ.
Baladi, V., and Vallée, B. 2005. Euclidean algorithms are Gaussian. J. Number Theory, 110, 331-386.
Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., and Tsuruta, K. 2014a. A new characterization of maximal repetitions by Lyndon trees. Manuscript available electronically at arXiv:1406.0263. To appear in SODA 2015.
Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., and Tsuruta, K. 2014b. The "runs" theorem. Manuscript available electronically at arXiv:1406.0263.
Baxa, C., and Schoissengeier, J. 1994. Minimum and maximum order of magnitude of the discrepancy of (na). Acta Arith., 68, 281-290.
Baxter, R. J. 1999. Planar lattice gases with nearest-neighbor exclusion. Ann. Comb., 3(2-4), 191-203. On combinatorics and statistical mechanics.
Baylis, J. 1998. Error-Correcting Codes: A Mathematical Introduction. Chapman and Hall Mathematics Series. London: Chapman & Hall.
Béal, M., and Perrin, D. 2014. A quadratic algorithm for road coloring. Discrete Applied Mathematics, 169, 15-29.
Béal, M.-P., Berstel, J., Marcus, B., et al. 2010. Variable-length codes and finite automata. Chap. 14, pages 505-584 of: Issac Woungang, Sudip Misra, S. C. M. (eds.), Selected Topics in Information and Coding Theory. World Scientific Publishing Company.
Béal, M., Berlinkov, M. V., and Perrin, D. 2011. A Quadratic upper bound on the size of a synchronizing word in one-cluster automata. Int. J. Found. Comput. Sci., 22(2), 277-288.
Bean, D. A., Ehrenfeucht, A., and McNulty, G. 1979. Avoidable patterns in strings of symbols. Pacific J. Math., 85, 261-294.
Beck, J. 1984. An application of Lovász local lemma: there exists an infinite 01-sequence containing no near identical intervals. Pages 103-107 of: Hajnal, A., et al. (eds.), Finite and Infinite Sets, Vol. I, II (Eger, 1981). Colloq. Math. Soc. János Bolyai, vol. 37. North-Holland.
Behnke, H. 1922. Uber die Verteilung von Irrationalzahlen mod 1. Hamb. abh, 1, 252-267.
Behnke, H. 1924. Theorie der Diophantischen Approximationen. Hamb. abh, 3, 261-318.
Bell, J. P. 2005. On the values attained by a k-regular sequence. Adv. in Appl. Math., 34(3), 634-643.
Bell, J. P., and Goh, T. L. 2007. Exponential lower bounds for the number of words of uniform length avoiding a pattern. Inform. and Comput., 205(9), 1295-1306.
Bell, T. C., Clearly, J. G., and Witten, I. H. 1990. Text Compression. New Jersey: Prentice Hall Inc.
Berger, R. 1966. The undecidability of the domino problem. Mem. Amer. Math. Soc. No., 66, 72.
Bergeron, F., and Reutenauer, C. 2010. SLk-tilings of the plane. Illinois J. Math., 54(1), 263-300.
Berlinkov, M. V. 2013. On the probability to be synchronizable. Manuscript available electronically at arXiv:1304.5774.
Berman, S., Moody, R., and Wonenburger, M. 1971/72. Cartan matrices with null roots and finite Cartan matrices. Indiana Univ. Math. J., 21, 1091-1099.
Berstel, J. 1994. A rewriting of Fife's theorem about overlap-free words. Pages 19-29 of: Karhumäki, J., Maurer, H., and Rozenberg, G. (eds.), Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol. 812. Springer-Verlag.
Berstel, J. 2005. Growth of repetition-free words -a review. Theoret. Comput. Sci., 340(2), 280-290.
Berstel, J., and Boasson, L. 1999. Partial words and a theorem of Fine and Wilf. Theoret. Comput. Sci., 218, 135-141.
Berstel, J., and Karhumäki, J. 2003. Combinatorics on words -a tutorial. Bull. European Assoc. Theor. Comput. Sci., 79, 178-228.
Berstel, J., and Reutenauer, C. 2011. Noncommutative rational series with applications. Encyclopedia of Mathematics and its Applications, vol. 137. Cambridge University Press.
Berstel, J., Perrin, D., and Reutenauer, C. 2007. Codes and Automata. Cambridge University Press.
Berstel, J., Lauve, A., Reutenauer, C., and Saliola, F. V. 2009. Combinatorics on Words. (Christoffel words and repetitions in words.) CRM Monograph Series, vol. 27. American Mathematical Society, Providence, RI.
Berthé, V., and Rigo, M. (eds.). 2010. Combinatorics, Automata and Number Theory. Encyclopedia Math. Appl., vol. 135. Cambridge University Press.
Bessenrodt, C., Holm, T., and Jørgensen, P. 2014. All SL2-tilings come from triangulations. Research report.
Bissinger, B. H. 1944. A generalization of continued fractions. Bull. Amer. Math. Soc., 50, 868-876.
Blanchet-Sadri, F. 2004a. Codes, orderings, and partial words. Theoret. Comput. Sci., 329(1-3), 177-202.
Blanchet-Sadri, F. 2004b. Periodicity on partial words. Comput. Math. Appl., 47(1), 71-82.
Blanchet-Sadri, F. 2007. Algorithmic Combinatorics on Partial Words. Boca Raton, FL: Chapman & Hall/CRC Press.
Blanchet-Sadri, F., and Hegstrom, R. A. 2002. Partial words and a theorem of Fine and Wilf revisited. Theoret. Comput. Sci., 270, 401-419.
Blanchet-Sadri, F., Mercaş, R., and Scott, G. 2009. A generalization of Thue freeness for partial words. Theoret. Comput. Sci., 410(8-10), 793-800.
Blondel, V. D., Cassaigne, J., and Jungers, R.M. 2009. On the number of a-power-free binary words for 2 < α ≤ 7/3. Theoret. Comput. Sci., 410(30-32), 2823-2833.
Böckenhauer, H.-J., and Bongartz, D. 2007. Algorithmic Aspects of Bioinformatics. Berlin: Springer.
Borchert, B. 2008. Formal language characterizations of P, NP, and PSPACE. J. Autom. Lang. Comb., 13(3-4), 161-183.
Borel, E. 1948. Sur les développements unitaires normaux. Ann. Soc. Pol. Math, 21, 74-79.
Borel, J.-P., and Laubie, F. 1993. Quelques mots sur la droite projective réelle. J. Théorie Nombres Bordeaux, 5, 23-51.
Borho, W., and Rosenberger, G. 1973. Eine Bemerkung zur Hecke-Gruppe G(λ). Abhandlungen aus dem Mathematischen Seminar der Universit ät Hamburg, 39, 83-87.
Borwein, P., and Hare, K. G. 2003. General forms for minimal spectral values for a class of quadratic Pisot numbers. Bull. London Math. Soc., 35(1), 47-54.
Bourgain, J., and Kontorovich, A. 2014. On Zaremba's conjecture. Ann. Math., 180, 137-196.
Bousquet-Mélou, M. 2005. Algebraic generating functions in enumerative combinatorics and context-free languages. Pages 18-35 of: STACS 2005. Lecture Notes in Comput. Sci., vol. 3404. Berlin: Springer.
Boyle, M. 1983. Lower entropy factors of sofic systems. Ergodic Theory Dynam. Systems, 3(4), 541-557.
Brandenburg, F.-J. 1983. Uniformly growing k-th power-free homomorphisms. Theoret. Comput. Sci., 23, 69-82.
Breslauer, D. 1992. An on-line string superprimitivity test. Inf. Process. Lett., 44(6), 345-347.
Brezinski, C. 1991. History of Continued fractions and Padé Approximants. Springer-Verlag.
Brocot, A. 1861. Calcul des rouages par approcimiation, nouvelle méthode. Revue chronométrique, 3, 186-194.
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S., and Stoye, J. 1999. Finding Maximal Pairs with Bounded Gap. Pages 134-149 of: Crochemore, M., and Paterson, M. (eds.), Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 1645. Springer.
Brown, S., Rampersad, N., Shallit, J., and Vasiga, T. 2006. Squares and overlaps in the Thue-Morse sequence and some variants. RAIRO Inform. Théor. App., 40, 473-484.
Bruyère, V., Hansel, G., Michaux, C., and Villemaire, R. 1994. Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc., 1, 191-238. Corrigendum, Bull. Belg. Math. Soc. 1 (1994), 577.
Budzban, G., and Feinsilver, P. 2011. The generalized road coloring problem and periodic digraphs. Appl. Algebra Eng. Commun. Comput., 22(1), 21-35.
Bugeaud, Y., Hubert, P., and Schmidt, T. 2013. Transcendence with Rosen continued fractions. J. Europ. Math. Soc., 15, 39-51.
Burton, R., Kraaikamp, C., and Schmidt, T. 2000. Natural extensions for the Rosen fractions. Trans. Amer. Math. Soc., 352(3), 1277-1298.
Caldero, P., and Chapoton, F. 2006. Cluster algebras as Hall algebras of quiver representations. Comment. Math. Helv., 81(3), 595-616.
Carbone, A. 2001. Cycles of relatively prime length and the road coloring problem. Israel J. Math., 123, 303-316.
Carpi, A. 1988a. Multidimensional unrepetitive configurations. Theoret. Comput. Sci., 56, 233-241.
Carpi, A. 1988b. On synchronizing unambiguous automata. Theoret. Comput. Sci., 60(3), 285-296.
Carpi, A. 1993. Overlap-free words and finite automata. Theoret. Comput. Sci., 115, 243-260.
Carpi, A. 2007. On Dejean's conjecture over large alphabets. Theoret. Comput. Sci., 385(1-3), 137-151.
Carpi, A., and D'Alessandro, F. 2013. Independent sets of words and the synchronization problem. Adv. in Appl. Math., 50(3), 339-355.
Cassaigne, J. 1993a. Counting overlap-free binary words. Pages 216-225 of: Enjalbert, P., Finkel, A., and Wagner, K. W. (eds.), STACS 93, Proc. 10th Symp. Theoretical Aspects of Comp. Sci. Lecture Notes in Computer Science, vol. 665. Springer-Verlag.
Cassaigne, J. 1993b. Unavoidable binary patterns. Acta Informatica, 30, 385-395.
Cenzer, D., Dashti, S. A., and King, J. L. F. 2008. Computable symbolic dynamics. MLQ Math. Log. Q., 54(5), 460-469.
Černý, J. 1964. Poznámka k homogénnym experimentom s konečnými automatmi. Mat. fyz. čas., SAV 14, 208-215.
Cesaratto, E., and Vallée, B. 2006. Hausdorff dimension of real numbers with bounded digits averages. Acta Arith., 125, 115-162.
Cesaratto, E., and Vallée, B. 2011. Small quotients in Euclidean algorithms. Ramanujan J., 24(2), 183-218.
Cesaratto, E., and Vallée, B. 2014. Metrical versions of the two distances theorem. To be submitted.
Cesaratto, E., Plagne, A., and Vallée, B. 2006. On the non randomness of modular arithmetic progressions. Discrete Math. Theor. Comput. Sci. Proc., AG, 271-288.
Chairungsee, S., and Crochemore, M. 2009. Efficient computing of longest previous reverse factors. Pages 27-30 of: Shoukourian, Y. (ed.), Seventh International Conference on Computer Science and Information Technologies (CSIT 2009). The National Academy of Sciences of Armenia Publishers, Yerevan, Armenia.
Charlier, É., Rampersad, N., and Shallit, J. 2012. Enumeration and decidable properties of automatic sequences. Internat. J. Found. Comput. Sci., 23(5), 1035-1066.
Chen, G., Puglisi, S. J., and Smyth, W. F. 2008. Lempel-Ziv factorization using less time & space. Mathematics in Computer Science, 1(4), 605-623.
Choffrut, C., and Karhumäki, J. 1997. Combinatorics of words. Pages 329-438 of: Rozenberg, G., and Salomaa, A. (eds.), Handbook of Formal Languages, vol. 1. Springer-Verlag.
Christou, M., Crochemore, M., Guth, O., Iliopoulos, C. S., and Pissis, S. P. 2011. On the right-seed array of a string. Pages 492-502 of: Fu, B., and Du, D.-Z. (eds.), Proceedings of the 17th Annual International Conference Computing and Combinatorics, COCOON 2011. Lecture Notes in Computer Science, vol. 6842. Springer.
Christou, M., Crochemore, M., Iliopoulos, C. S., et al. 2013. Efficient seed computation revisited. Theoret. Comput. Sci., 483, 171-181.
Chuquet, N. 1881. Triparty en la science des nombres. Imprimerie des sciences mathématiques et physiques.
Clemens, J. D. 2009. Isomorphism of subshifts is a universal countable Borel equivalence relation. Israel J. Math., 170, 113-123.
Conway, J. H., and Coxeter, H. S.M. 1973a. Triangulated polygons and frieze patterns. Math. Gaz., 57(400), 87-94.
Conway, J. H., and Coxeter, H. S.M. 1973b. Triangulated polygons and frieze patterns. Math. Gaz., 57(401), 175-183.
Cornfeld, I. P., Fomin, S. V., and Sinaĭ, Y. G. 1982. Ergodic theory. New York: Springer-Verlag. Translated from the Russian by A. B. Sosinskiĭ.
Coxeter, H. S. M. 1971. Frieze patterns. Acta Arith., 18, 297-310.
Crochemore, M. 1981. An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett., 12(5), 244-250.
Crochemore, M. 1982a. A solution to Berstel's problem no. P3. Bull. European Assoc. Theor. Comput. Sci., 18, 9-11.
Crochemore, M. 1982b. Sharp characterizations of squarefree morphisms. Theoret. Comput. Sci., 18(2), 221-226.
Crochemore, M. 1986. Transducers and repetitions. Theoret. Comput. Sci., 45(1), 63-86.
Crochemore, M. 2014 (June). Repeats in Strings. Keynote talk at CPM 2014. https://tech.yandex.com/events/cpm/2014/talks/168/.
Crochemore, M., and Ilie, L. 2007. Analysis of maximal repetitions in strings. Pages 465-476 of: Kucera, L., and Kucera, A. (eds.), Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007. Lecture Notes in Computer Science, vol. 4708. Springer.
Crochemore, M., and Ilie, L. 2008a. Computing longest previous factors in linear time and applications. Information Processing Letters, 106(2), 75-80.
Crochemore, M., and Ilie, L. 2008b. Maximal repetitions in strings. Journal of Computer and System Sciences, 74, 796-807.
Crochemore, M., and Rytter, W. 1995. Squares, cubes and time-space efficient stringsearching. Algorithmica, 13(5), 405-425.
Crochemore, M., and Rytter, W. 2003. Jewels of Stringology. Singapore: World Scientific Publishing Co. Pte. Ltd.
Crochemore, M., Hancart, C., and Lecroq, T. 2007. Algorithms on Strings. Cambridge University Press.
Crochemore, M., Ilie, L., and Smyth, W. F. 2008. A simple algorithm for computing the Lempel-Ziv factorization. Pages 482-488 of: Storer, J. A., and Marcellin, M. W. (eds.), 18th Data Compression Conference. IEEE Computer Society, Los Alamitos, CA. Snowbird, UT, USA, 25-27 March 2008.
Crochemore, M., Ilie, L., Iliopoulos, C., et al. 2009. LPF Computation Revisited. Pages 158-169 of: Fiala, J., Kratochvíl, J., and Miller, M. (eds.), IWOCA. LNCS, vol. 5874. Berlin: Springer.
Crochemore, M., Iliopoulos, C., Kubica, M., Rytter, W., and Waleń, T. 2010a. Efficient algorithms for two extensions of the LPF table: the power of suffix arrays. Pages 296-307 of: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., and Rumpe, B. (eds.), SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic. Lecture Notes in Computer Science, vol. 5901. Berlin: Springer.
Crochemore, M., Fazekas, S. Z., Iliopoulos, C., and Jayasekera, I. 2010b. Number of occurrences of powers in strings. International Journal of Foundations of Computer Science, 21(4), 535-547.
Crochemore, M., Ilie, L., and Tinta, L. 2011. The "runs" conjecture. Theoret. Comput. Sci., 412(27), 2931-2941.
Crochemore, M., Iliopoulos, C. S., Kubica, M., et al. 2012. The maximal number of cubic runs in a word. Journal Computer System Science, 78(6), 1828-1836.
Crochemore, M., Iliopoulos, C. S., Kubica, M., et al. 2014. New simple efficient algorithms computing powers and runs in strings. Discrete Applied Mathematics, 163(3), 258-267.
Culik II, K. 1996. An aperiodic set of 13 Wang tiles. Discrete Math., 160, 245-251.
Culik II, K., Pachl, J., and Yu, S. 1989. On the limit sets of cellular automata. SIAM Journal on Computing, 18(4), 831-842.
Culik, II, K., Karhumäki, J., and Kari, J. 2002. A note on synchronized automata and road coloring problem. Pages 175-185 of: Developments in Language Theory (Vienna, 2001). Lecture Notes in Comput. Sci., vol. 2295. Berlin: Springer.
Currie, J. 2005. Pattern avoidance: themes and variations. Theoret. Comput. Sci., 339, 7-18.
Currie, J., and Linek, V. 2001. Avoiding patterns in the abelian sense. Canadian J. Math., 53, 696-714.
Currie, J. D., and Rampersad, N. 2009a. Dejean's conjecture holds for n = 27. RAIRO Inform. Théor. App., 43, 775-778.
Currie, J. D., and Rampersad, N. 2009b. Dejean's conjecture holds for n = 30. Theoret. Comput. Sci., 410, 2885-2888.
Currie, J. D., and Rampersad, N. 2011. A proof of Dejean's conjecture. Math. Comp., 80, 1063-1070.
Currie, J. D., and Rampersad, N. 2012. Fixed points avoiding abelian k-powers. J. Combin. Theory Ser. A, 119(5), 942-948.
Currie, J., and Simpson, J. 2002. Non-repetitive tilings. Electronic J. Combinatorics, 9, #R28.
Currie, J., and Visentin, T. 2007. On abelian 2-avoidable binary patterns. Acta Informatica, 43, 521-533.
Currie, J., and Visentin, T. 2008. Long binary patterns are abelian 2-avoidable. Theoret. Comput. Sci., 409, 432-437.
Daireaux, B., and Vallée, B. 2004. Dynamical analysis of the parameterized Lehmer-Euclid Algorithm. Combinatorics, Probability, Computing, 13(4/5), 499-536.
Dajani, K., and de Vries, M. 2005. Measures of maximal entropy for random β-expansions. J. Eur. Math. Soc. (JEMS), 7(1), 51-68.
Dajani, K., and de Vries, M. 2007. Invariant densities for random β-expansions. J. Eur. Math. Soc. (JEMS), 9(1), 157-176.
Dajani, K., and Kraaikamp, C. 2002. From greedy to lazy expansions and their driving dynamics. Expo. Math., 20(4), 315-327.
Dajani, K., and Kraaikamp, C. 2003. Random β-expansions. Ergodic Theory Dynam. Systems, 23(2), 461-479.
Dajani, K., Kraaikamp, C., and Steiner, W. 2009. Metrical theory for a-continued fractions. J. Eur. Math. Soc. (JEMS), 11, 1259-1283.
Dajani, K., de Vries, M., Komornik, V., and Loreti, P. 2012. Optimal expansions in non-integer bases. Proc. Amer. Math. Soc., 140(2), 437-447.
Damanik, D., and Lenz, D. 2002. The index of Sturmian sequences. European J. Combinatorics, 23, 23-29.
Daróczy, Z., and Kátai, I. 1993. Univoque sequences. Publ. Math. Debrecen, 42(3-4), 397-407.
Daróczy, Z., and Kátai, I. 1995. On the structure of univoque numbers. Publ. Math. Debrecen, 46(3-4), 385-408.
Daudé, H., Flajolet, P., and Vallée, B. 1997. An average-case analysis of the Gaussian algorithm for lattice reduction. Combinatorics, Probability and Computing, 6, 397-433.
de Luca, A., and De Luca, A. 2006. Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci., 362(1-3), 282-300.
de Luca, A., and Mignosi, F. 1994. Some combinatorial properties of Sturmian words. Theoret. Comput. Sci., 136, 361-385.
de Luca, A., and Mione, L. 1994. On bispecial factors of the Thue-Morse word. Inform. Process. Lett., 49, 179-183.
de Vries, M. 2008. A property of algebraic univoque numbers. Acta Math. Hungar., 119(1-2), 57-62.
de Vries, M. 2009. On the number of unique expansions in non-integer bases. Topology Appl., 156(3), 652-657.
de Vries, M., and Komornik, V. 2009. Unique expansions of real numbers. Adv. Math., 221(2), 390-427.
de Vries, M., and Komornik, V. 2011. A two-dimensional univoque set. Fund. Math., 212(2), 175-189.
Dejean, F. 1972. Sur un théorème de Thue. J. Combin. Theory. Ser. A, 13, 90-99.
Dekking, F. M. 1976. On repetitions of blocks in binary sequences. J. Combin. Theory. Ser. A, 20(3), 292-299.
Dekking, F. M. 1979. Strongly non-repetitive sequences and progression-free sets. J. Combin. Theory. Ser. A, 27, 181-185.
Deza, A., Franek, F., and Thierry, A. 2014. How many double squares can a string contain? Discrete Applied Mathematics. In press.
Di Francesco, P. 2010. The solution of the Ar T-system for arbitrary boundary. Electron. J. Combin., 17(1), Research Paper 89, 43.
Dolgopyat, D. 1998. On decay of correlations in Anosov flows. Ann. of Math., 147, 357-390.
Downarowicz, T. 1999. Reading along arithmetic progressions. Colloq. Math., 80, 293-296.
Drmota, M., and Tichy, R. F. 1997. Sequences, Discrepancies, and Applications. Lecture Notes in Mathematics, vol. 1651. Springer-Verlag.
Drobot, V. 1973. On sums of powers of a number. Amer. Math. Monthly, 80, 42-44.
Drobot, V., and McDonald, S. 1980. Approximation properties of polynomials with bounded integer coefficients. Pacific J. Math., 86(2), 447-450.
Du, C. F., Mousavi, H., Schaeffer, L., and Shallit, J. 2014. Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance. Available electronically at arXiv:1406.0670.
Dubuc, L. 1998. Sur les automates circulaires et la conjecture de Černý. RAIRO Inform. Théor. Appl., 32(1-3), 21-34.
Dumitrescu, A., and Radoičić, R. 2004. On a coloring problem for the integer grid. Pages 67-74 of: Towards a theory of geometric graphs. Contemp. Math., vol. 342. Amer. Math. Soc.
Durand, B. 1994. The surjectivity problem for 2D cellular automata. Journal of Computer and System Sciences, 49(3), 718-725.
Durand, B., Formenti, E., and Varouchas, G. 2003. On undecidability of equicontinuity classification for cellular automata. Pages 117-128 of: Morvan, M., and Rémila, É. (eds.), Discrete Models for Complex Systems, DMCS'03. DMTCS Proceedings, vol. AB. Discrete Mathematics & Theoretical Computer Science.
Durand, B., Levin, L. A., and Shen, A. 2008. Complex tilings. J. Symbolic Logic, 73(2), 593-613.
Durand, B., Romashchenko, A., and Shen, A. 2009. Fixed-point tile sets and their applications. preprint.
Durand, B., Romashchenko, A., and Shen, A. 2012. Fixed-point tile sets and their applications. Journal of Computer and System Sciences, 78(3), 731-764.
Edwards, H. 2001. Riemann's Zeta Function. Dover Publications.
Eilenberg, S. 1974. Automata, Languages, and Machines. Vol. A. Academic Press.
Eilenberg, S. 1976. Automata, Languages, and Machines. Vol. B. Academic Press.
Ekhad, S. B., and Zeilberger, D. 1998. There are more than 2(n/17) n-letter ternary square-free words. J. Integer Sequences, 1, 98.1.9.
Engel, F. 1913. Entwicklung der Zahlen nach Stammbruechen. Pages 190-191 of: Verhandlungen der 52. Versammlung deutscher Philologen und Schulmaenner in Marburg.
Entringer, R. C., Jackson, D. E., and Schatz, J. A. 1974. On nonrepetitive sequences. J. Combin. Theory. Ser. A, 16, 159-164.
Eppstein, D. 1990. Reset sequences for monotonic automata. SIAM J. Comput., 19(3), 500-510.
Erdos, P. 1939. On a family of symmetric Bernoulli convolutions. Amer. J. Math., 61, 974-976.
Erdos, P. 1940. On the smoothness properties of a family of Bernoulli convolutions. Amer. J. Math., 62, 180-186.
Erdos, P. 1961. Some unsolved problems. Magyar Tud. Akad. Mat. Kutat ó Int. Közl., 6, 221-254.
Erdos, P., and Joó, I. 1992. On the number of expansions 1= ∑q-ni. Ann. Univ. Sci. Budapest. Eötvös Sect. Math., 35, 129-132.
Erdos, P., and Komornik, V. 1998. Developments in non-integer bases. Acta Math. Hungar., 79(1-2), 57-83.
Erdos, P., Joó, I., and Komornik, V. 1990. Characterization of the unique expansions 1 = ∑∞ i=1 q-ni and related problems. Bull. Soc. Math. France, 118(3), 377-390.
Erdos, P., Horváth, M., and Joó, I. 1991. On the uniqueness of the expansions 1 = ∑q-ni. Acta Math. Hungar., 58(3-4), 333-342.
Erdos, P., Joó, I., and Komornik, V. 1994. On the number of q-expansions. Ann. Univ. Sci. Budapest. Eötvös Sect. Math., 37, 109-118.
Erdos, P., Joó, I., and Komornik, V. 1998. On the sequence of numbers of the form ε0+ε1q+ ...+εnqn, εi ∈ {0,1}Acta Arith., 83(3), 201-210.
Evdokimov, A. A. 1968. Strongly asymmetric sequences generated by a finite number of symbols. Dokl. Akad. Nauk SSSR, 179, 1268-1271. In Russian. English translation in Soviet Math. Dokl. 9 (1968), 536-539.
Everett, C. J. 1946. Representations for real numbers. Bull. Amer. Math. Soc., 52, 861-869.
Falconer, K. 2014. Fractal Geometry, 3rd edition. (Mathematical foundations and applications.) John Wiley & Sons, Ltd., Chichester.
Feng, D.-J. 2011. On the topology of polynomials with bounded integer coefficients. Manuscript available electronically at arXiv:1109.1407.
Feng, D.-J., and Sidorov, N. 2011. Growth rate for beta-expansions. Monatsh. Math., 162(1), 41-60.
Fife, E. D. 1980. Binary sequences which contain no BBb. Trans. Amer. Math. Soc., 261, 115-136.
Fife, E. D. 1983. Irreducible binary sequences. Pages 91-100 of: Cummings, L. J. (ed.), Combinatorics on Words: Progress and Perspectives. Academic Press.
Fine, N. J., and Wilf, H. S. 1965. Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc., 16, 109-114.
Fischer, J., and Heun, V. 2006. Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. Pages 36-48 of: Lewenstein, M., and Valiente, G. (eds.), Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 4009. Springer.
Fischer, M. J., and Paterson, M. S. 1974. String-matching and other products. Pages 113-125. SIAM-AMS Proc., Vol. VII of: Karp, R. (ed.), Complexity of Computation (Proc. SIAM-AMS Appl. Math. Sympos., New York, 1973). Providence, R. I.: Amer. Math. Soc.
Flajolet, P., and Vallée, B. 1998. Continued fraction algorithms,functional operators, and structure constants. Theoret. Comput. Sci., 194(1-2), 1-34.
Flatto, L., Lagarias, J. C., and Poonen, B. 1994. The zeta function of the beta transformation. Ergodic Theory Dynam. Systems, 14(2), 237-266.
Fomin, S., and Zelevinsky, A. 2002a. Cluster algebras. I. Foundations. J. Amer. Math. Soc., 15(2), 497-529 (electronic).
Fomin, S., and Zelevinsky, A. 2002b. The Laurent phenomenon. Adv. in Appl. Math., 28(2), 119-144.
Fomin, S., and Zelevinsky, A. 2003. Cluster algebras. II. Finite type classification. Invent. Math., 154(1), 63-121.
Foreman, M., Rudolph, D. J., and Weiss, B. 2011. The conjugacy problem in ergodic theory. Ann. of Math. (2), 173(3), 1529-1586.
Fraenkel, A. S., and Simpson, J. 1995. How many squares must a binary sequence contain? Electronic J. Combinatorics, 2, #R2.
Fraenkel, A. S., and Simpson, J. 1998. How many squares can a string contain? J. Combin. Theory. Ser. A, 82(1), 112-120.
Franek, F., and Yang, Q. 2006. An asymptotic lower bound for the maximal-number-of-runs function. Pages 3-8 of: Holub, J., and Zdárek, J. (eds.), Proceedings of the Prague Stringology Conference. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University.
Franek, F., Smyth,W. F., and Tang, Y. 2003. Computing all repeats using suffix arrays. Journal of Automata, Languages and Combinatorics, 8(4), 579-591.
Friedman, J. 1990. On the road coloring problem. Proc. Amer. Math. Soc., 110(4), 1133-1135.
Garsia, A.M. 1962. Arithmetic properties of Bernoulli convolutions. Trans. Amer. Math. Soc., 102, 409-432.
Gel'fond, A. O. 1959. A common property of number systems. Izv. Akad. Nauk SSSR. Ser. Mat., 23, 809-814.
Giraud, M. 2009. Asymptotic behavior of the numbers of runs and microruns. Inf. Comput., 207(11), 1221-1228.
Glendinning, P., and Sidorov, N. 2001. Unique representations of real numbers in non-integer bases. Math. Res. Lett., 8(4), 535-543.
Goralcik, P., and Vanicek, T. 1991. Binary patterns in binary words. Internat. J. Algebra Comput., 1, 387-391.
Gottschalk, W. H., and Hedlund, G. A. 1964. A characterization of the Morse minimal set. Proc. Amer. Math. Soc., 15, 70-74.
Goč, D., Henshall, D., and Shallit, J. 2012. Automatic theorem-proving in combinatorics on words. Pages 180-191 of: Moreira, N., and Reis, R. (eds.), CIAA 2012. Lecture Notes in Computer Science, vol. 7381. Springer-Verlag.
Goulden, I., and Jackson, D. 2004. Combinatorial Enumeration. Dover.
Graham, R., Rothschild, B., and Spencer, J. 1990. Ramsey Theory, 2nd edition. Wiley.
Grünbaum, B., and Shephard, G. C. 1986. Tilings and Patterns. New York: W. H. Freeman & Co.
Grytczuk, J. 2002. Thue-like sequences and rainbow arithmetic progressions. Electronic J. Combinatorics, 9, #R44.
Grytczuk, J. 2006. Nonrepetitive graph coloring. Pages 209-218 of: Graph Theory in Paris. Trends in Mathematics. Basel: Birkhäuser.
Grytczuk, J., Kozik, J., and Micek, P. 2011a. Nonrepetitive games. Manuscript available electronically at arXiv:1103.3810.
Grytczuk, J., Kozik, J., and Witkowski, M. 2011b. Nonrepetitive sequences on arithmetic progressions. Electronic J. Combinatorics, 18, #P209.
Grytczuk, J., Kozik, J., and Micek, P. 2013. A new approach to nonrepetitive sequences. Random Structures and Algorithms, 42.
Guglielmi, N., and Protasov, V. 2013. Exact computation of joint spectral characteristics of linear operators. Found. Comput. Math., 13, 37-97.
Guillon, P., and Zinoviadis, C. 2012. Densities and entropies in cellular automata. Pages 253-263 of: How the world computes. Lecture Notes in Computer Science, vol. 7318. Springer, Heidelberg.
Gurevič, J. Š., and Korjakov, I. O. 1972a. A remark on R. Berger's work on the domino problem. Sibirsk. Mat. Ž., 13, 459-463.
Gurevich, Y. S., and Koryakov, I. O. 1972b. Remarks on Berger's paper on the domino problem. Siberian Mathematical Journal, 13, 319-321.
Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences -Computer Science and Computational Biology. Cambridge University Press.
Gusfield, D., and Stoye, J. 2004. Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci., 69(4), 525-546.
Haas, A., and Series, C. 1986. The Hurwitz constant and Diophantine approximation on Hecke groups. J. London Math. Soc., 34(2), 219-234.
Halava, V., Harju, T., and Kärki, T. 2007a. Relational codes of words. Theoret. Comput. Sci., 389(1-2), 237-249.
Halava, V., Harju, T., Kärki, T., and Zamboni, L. Q. 2007b. Relational Fine and Wilf words. Pages 159-167 of: Arnoux, P., Bédaride, N., and Cassaigne, J. (eds.), Proceedings of WORDS 2007. IML. Also available at http://www.tucs.fi/research/series/ as a technical report 839 of TUCS Turku Centre for Computer Science.
Halava, V., Harju, T., and Kärki, T. 2008a. Interaction properties of relational periods. Discrete Math. & Theor. Comput. Sci., 10(1), 87-111.
Halava, V., Harju, T., and Kärki, T. 2008b. Square-free partial words. Inform. Process. Lett., 108(5), 290-292.
Halava, V., Harju, T., Kärki, T., and Séébold, P. 2009. Overlap-freeness in infinite partial words. Theoret. Comput. Sci., 410(8-10), 943-948.
Hanf, W. 1974. Nonrecursive tilings of the plane. I. J. Symbolic Logic, 39, 283-285.
Happel, D., Preiser, U., and Ringel, C. M. 1980. Vinberg's characterization of Dynkin diagrams using subadditive functions with application to DTr-periodic modules. Pages 280-294 of: Representation Theory, II (Proc. Second Internat. Conf., Carleton Univ., Ottawa, Ont., 1979). Lecture Notes in Math., vol. 832. Berlin: Springer.
Hardy, G. H., and Wright, E. M. 1985. An Introduction to the Theory of Numbers, 5th edition. Oxford University Press.
Harju, T., and Kärki, T. 2014 (April). Minimal similarity relations for square-free words, Manuscript 2014. Unpublished manuscript.
Harju, T., and Nowotka, D. 2006. Binary words with few squares. Bulletin of the EATCS, 89, 164-166.
Head, T., andWeber, A. 1995. Deciding multiset decipherability. IEEE Trans. Inform. Theory, 41(1), 291-297.
Hedlund, G. A. 1969. Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory, 3, 320-375.
Heeffer, A. 2014. Cardano's favorite problem: the Proportio Reflexa. Math. Intelligencer.
Hensley, D. 1992. Continued fraction Cantor sets, Hausdorff dimension, and functional analysis. J. Number Theory, 40, 336-358.
Hensley, D. 2006. Continued Fractions. World Scientific.
Hinman, P. G. 2012. A survey of Mučnik and Medvedev degrees. Bull. Symbolic Logic, 18(2), 161-229.
Hochman, M. 2009. On the dynamics and recursive properties of multidimensional symbolic systems. Invent. Math., 176(1), 131-167.
Hochman, M. 2012. Rohlin properties for Zd actions on the Cantor set. Trans. Amer. Math. Soc., 364(3), 1127-1143.
Hochman, M., and Meyerovitch, T. 2010. A characterization of the entropies of multidimensional shifts of finite type. Ann. of Math. (2), 171(3), 2011-2038.
Hohlweg, C., and Reutenauer, C. 2003. Lyndon words, permutations and trees. Theoret. Comput. Sci., 307(1), 173-178.
Holm, T., and Jørgensen, P. 2013. SL2-tilings and triangulations of the strip. J. Combin. Theory Ser. A, 120(7), 1817-1834.
Honkala, J. 1986. A decision method for the recognizability of sets defined by number systems. RAIRO Inform. Théor. App., 20, 395-403.
Hopcroft, J. E., and Ullman, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
Hopcroft, J. E., Motwani, R., and Ullman, J. D. 2006. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. 3rd Edition.
Hurd, L. P., Kari, J., and Culik II, K. 1992. The topological entropy of cellular automata is uncomputable. Ergodic Theory and Dynamical Systems, 12(6), 255-265.
Hurwitz, A. 1894. Über die angenäherte Darstellung der Zahlen durch rationale Brüche. Math. Ann., 44(2), 417-436.
Ilie, L. 2005. A simple proof that a word of length has at most 2 distinct squares. J. Comb. Theory, Ser. A, 112(1), 163-164.
Ilie, L. 2007. A note on the number of squares in a word. Theoret. Comput. Sci., 380(3), 373-376.
Iliopoulos, C. S., Moore, D., and Smyth, W. F. 1997. A characterization of the squares in a Fibonacci string. Theoret. Comput. Sci., 172(1-2), 281-291.
Iliopoulos, C. S., Moore, D., and Park, K. 1996. Covering a string. Algorithmica, 16(3), 288-297.
Jacobs, K., and Keane, M. 1969. 0-1-sequences of Toeplitz type. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 13, 123-131.
Janvresse, E., Rittaud, B., and de la Rue, T. 2008. How do random Fibonacci sequences grow? Probability Theory and Related Fields, 142(3), 619-648.
Janvresse, E., Rittaud, B., and de la Rue, T. 2009. Growth rate for the expected value of a generalized random Fibonacci sequence. Journal of Physics A, 42(8), 085005.
Janvresse, E., Rittaud, B., and de la Rue, T. 2010. Almost-sure growth rate of generalized random Fibonacci sequences. Ann. Inst. Henri Poincaré, 46(1), 135-158.
Janvresse, E., Rittaud, B., and de la Rue, T. 2013. Dynamics of λ-continued fractions and β-shifts. Discrete and Continuous Dynamical Systems Series A, 33(4), 1477-1498.
Jeandel, E., and Vanier, P. 2011. Π01 sets and tilings. Pages 230-239 of: Theory and Applications of Models of Computation. Lecture Notes in Comput. Sci., vol. 6648. Springer, Heidelberg.
Jeandel, E., and Rao, M. 2015. An aperiodic set of 11 Wang tiles. Preprint available electronically at https://hal.inria.fr/hal-01166053v2.
Jeandel, E., and Vanier, P. 2015. Characterizations of periods of multi-dimensional shifts. Ergodic Theory and Dynamical Systems, 35(4), 431-460.
Jessen, B., andWintner, A. 1935. Distribution functions and the Riemann zeta function. Trans. Amer. Math. Soc., 38(1), 48-88.
Jungers, R., Protasov, V., and Blondel, V. 2009. Overlap-free words and spectra of matrices. Theoret. Comput. Sci., 410, 3670-3684.
Kallós, G. 1999. The structure of the univoque set in the small case. Publ. Math. Debrecen, 54(1-2), 153-164.
Kallós, G. 2001. The structure of the univoque set in the big case. Publ. Math. Debrecen, 59(3-4), 471-489.
Kao, J.-Y., Rampersad, N., Shallit, J., and Silva, M. 2008. Words avoiding repetitions in arithmetic progressions. Theoret. Comput. Sci., 391, 126-137.
Karhumäki, J., Lepistö, A., and Plandowski, W. 2002. Locally periodic versus globally periodic infinite words. J. Combin. Theory. Ser. A, 100, 250-264.
Karhumäki, J., and Shallit, J. 2004. Polynomial versus exponential growth in repetition-free binary words. J. Combin. Theory Ser. A, 105(2), 335-347.
Kari, J. 1992. The nilpotency problem of one-dimensional cellular automata. SIAM Journal on Computing, 21(3), 571-586.
Kari, J. 1994. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, 48(1), 149-182.
Kari, J. 1996. A small aperiodic set of Wang tiles. Discrete Math., 160, 259-264.
Kari, J. 2005. Theory of cellular automata: a survey. Theoret. Comput. Sci., 334(1-3), 3-33.
Kari, J. 2007. The tiling problem revisited (Extended Abstract). Pages 72-79 of: Durand-Lose, J., and Margenstern, M. (eds.), Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4664. Springer.
Kari, J. 2008. Undecidable properties on the dynamics of reversible one-dimensional cellular automata. Pages 3-14 of: Durand, B. (ed.), First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), Uzès, France, April 21-25, 2008. Proceedings. MCCME Publishing House, Moscow.
Kari, J. 2009. Tiling problem and undecidability in cellular automata. Pages 9158-9172 of: Meyers, R. A. (ed.), Encyclopedia of Complexity and Systems Science. Springer.
Kari, J. 2011. Snakes and cellular automata: reductions and inseparability results. Pages 223-232 of: Kulikov, A. S., and Vereshchagin, N. K. (eds.), Computer Science-Theory and Applications-6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings. Lecture Notes in Computer Science, vol. 6651. Springer.
Kari, J. 2012. Basic concepts of cellular automata. Pages 3-24 of: Rozenberg, G., Bäck, T., and Kok, J. N. (eds.), Handbook of Natural Computing. Springer.
Kari, J., and Ollinger, N. 2008. Periodicity and immortality in reversible computing. Pages 419-430 of: Ochmanski, E., and Tyszkiewicz, J. (eds.), Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings. Lecture Notes in Computer Science, vol. 5162. Springer.
Kari, J., and Papasoglu, P. 1999. Deterministic aperiodic tile sets. Geometric and Functional Analysis GAFA, 9(2), 353-369.
Kari, J. 2001. A counter example to a conjecture concerning synchronizing words in finite automata. EATCS Bulletin, 73, 146.
Kari, J. 2003. Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci., 295(1-3), 223-232.
Kari, J., and Volkov, M. 2014. Černý conjecture and the road coloring problem. In: Handbook of Automata Theory. European Mathematical Society. to appear.
Kärki, T. 2008. Relational Words: Periodicity and Repetition Freeness. Ph.D. thesis, TUCS Volume 98, University of Turku.
Kärki, T. 2012. Repetition-freeness with cyclic relations and chain relations. Fund. Inform., 116, 157-174.
Kärkkäinen, J., Kempa, D., and Puglisi, S. J. 2013. Linear time Lempel-Ziv factorization: simple, fast, small. Pages 189-200 of: Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 7922. Springer.
Kärkkäinen, J., and Sanders, P. 2003. Simple linear work suffix array construction. Pages 943-955 of: Baeten, J. C. M., Lenstra, J. K., Parrow, J., and Woeginger, G. J. (eds.), Proceedings of the 30th International Colloquium: Automata, Languages and Programming, ICALP 2003. Lecture Notes in Computer Science, vol. 2719. Springer.
Kasteleyn, P. W. 1963. Dimer statistics and phase transitions. J. Mathematical Phys., 4, 287-293.
Kátai, I., and Kallós, G. 2001. On the set for which 1 is univoque. Publ. Math. Debrecen, 58(4), 743-750.
Keller, B., and Scherotzke, S. 2011. Linear recurrence relations for cluster variables of affine quivers. Adv. Math., 228(3), 1842-1862.
Keller, G. 1989. Markov extensions, zeta functions, and Fredholm theory for piecewise invertible dynamical systems. Trans. Amer. Math. Soc., 314, 433-497.
Kempton, T. 2013. Counting β-expansions and the absolute continuity of Bernoulli convolutions. Monatsh. Math., 171(2), 189-203.
Kempton, T. 2014. On the invariant density of the random β-transformation. Acta Math. Hungar., 142(2), 403-419.
Kenyon, R. 2000. The planar dimer model with boundary: a survey. Pages 307-328 of: Directions in Mathematical Quasicrystals. CRM Monogr. Ser., vol. 13. Amer. Math. Soc., Providence, RI.
Keränen, V. 1992. Abelian squares are avoidable on 4 letters. Pages 41-52 of: Kuich,W. (ed.), Proc. 19th Intl. Conf. on Automata, Languages, and Programming (ICALP). Lecture Notes in Computer Science, vol. 623. Springer-Verlag.
Khinchin, A. Y. 1964. Continued Fractions. The University of Chicago Press.
Kitchens, B. P. 1998. Symbolic Dynamics. (One-sided, two-sided and countable state Markov shifts.) Universitext. Berlin: Springer-Verlag.
Kleene, S. C. 1956. Representation of events in nerve nets and finite automata. Pages 3-42 of: Automata Studies. Princeton University Press.
Knuth, D. 1998. The Art of Computer Programming, 3rd edition. Addison Wesley.
Knuth, D. E.,Morris, J., and Pratt, V. 1977. Fast pattern matching in strings. SIAM J. Comput., 6(2), 323-350.
Ko, P., and Aluru, S. 2005. Space efficient linear time construction of suffix arrays. J. Discrete Algorithms, 3(2-4), 143-156.
Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., and Waleń, T. 2012. A linear time algorithm for seeds computation. Pages 1095-1112 of: Rabani, Y. (ed.), Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2012.
Kolpakov, R., and Kucherov, G. 1999. Finding Maximal Repetitions in aWord in Linear Time. Pages 596-604 of: Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science. New York: IEEE Computer Society Press.
Kolpakov, R., and Kucherov, G. 2008. Searching for Gapped Palindromes. Pages 18-30 of: Ferragina, P., and Landau, G. M. (eds.), Combinatorial Pattern Matching, 19th Annual Symposium, Pisa, Italy, June 18-20, 2008. Lecture Notes in Computer Science, vol. 5029. Berlin: Springer.
Komatsu, T. 2002. An approximation property of quadratic irrationals. Bull. Soc. Math. France, 130(1), 35-48.
Komornik, V. 2011. Expansions in noninteger bases. Integers, 11B, Paper No. A9, 30.
Komornik, V. 2012. Unique infinite expansions in noninteger bases. Acta Math. Hungar., 134(3), 344-355.
Komornik, V., and Loreti, P. 1998. Unique developments in non-integer bases. Amer. Math. Monthly, 105(7), 636-639.
Komornik, V., and Loreti, P. 1999. On the expansions in non-integer bases. Rend. Mat. Appl. (7), 19(4), 615-634 (2000).
Komornik, V., and Loreti, P. 2002. Subexpansions, superexpansions and uniqueness properties in non-integer bases. Period. Math. Hungar., 44(2), 197-218.
Komornik, V., and Loreti, P. 2007. On the topological structure of univoque sets. J. Number Theory, 122(1), 157-183.
Komornik, V., Loreti, P., and Pedicini, M. 2000. An approximation property of Pisot numbers. J. Number Theory, 80(2), 218-237.
Komornik, V., Lai, A. C., and Pedicini, M. 2011. Generalized golden ratios of ternary alphabets. J. Eur. Math. Soc. (JEMS), 13(4), 1113-1146.
Komornik, V., Kong, D., and Li, W. 2014. Hausdorff dimension of univoque sets and Devil's staircase. In preparation.
Kong, D., and Li, W. 2014. On the Hausdorff dimension of unique beta expansions. Manuscript available electronically at arXiv:1401.6473.
Kraaikamp, C., and Wu, J. 2004. On a new continued fraction expansion with non-decreasing partial quotients. Monatsh. Math., 143, 285-298.
Kraaikamp, C., Schmidt, T., and Smeets, I. 2007. Tong's spectrum for Rosen continued fractions. J. Théorie Nombres Bordeaux, 19(3), 641-661.
Kraaikamp, C., Nakada, H., and Schmidt, T. 2009. Metric and arithmetic properties of mediant-Rosen maps. Acta Arith., 137(4), 295-324.
Kraaikamp, C., Schmidt, T., and Smeets, I. 2010. Natural extensions for a-Rosen continued fractions. J. Math. Soc Japan, 62(2), 649-671.
Krieger, D. 2008. Critical Exponents and Stabilizers of InfiniteWords. Ph.D. thesis, University of Waterloo.
Kuipers, L., and Niederreiter, H. 1974. Uniform Distribution of Sequences. Wiley.
Kůrka, P. 1999. Zero-dimensional dynamical systems, formal languages, and universality. Theory Comput. Syst., 32(4), 423-433.
Lai, A. C. 2011. Minimal unique expansions with digits in ternary alphabets. Indag. Math. (N.S.), 21(1-2), 1-15.
Lee, K., and Schiffler, R. 2013. Positivity for cluster algebras. Manuscript available electronically at arXiv:1306.2415.
Leutbecher, A. 1967. Über die Heckeschen Gruppen G(λ). Abhandlungen aus dem Mathematischen Seminar der Universit ät Hamburg, 31, 199-205.
Leutbecher, A. 1974. Ü ber die Heckeschen Gruppen G(λ) II. Math. Annalen, 211, 63-86.
Lhote, L., and Vallée, B. 2008. Gaussian laws for the main parameters of the Euclid algorithm. Algorithmica, 50(4), 497-554.
Li, Y., and Smyth,W. F. 2002. Computing the cover array in linear time. Algorithmica, 32(1), 95-106.
Liardet, P., and Stambul, P. 2000. Séries de Engel et fractions continuées. J. Théorie Nombres Bordeaux, 12(1), 37-68.
Lind, D. A. 1984. The entropies of topological Markov shifts and a related class of algebraic integers. Ergodic Theory Dynam. Systems, 4(2), 283-300.
Lind, D., and Marcus, B. 1995. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press.
Lind, D., Schmidt, K., and Ward, T. 1990. Mahler measure and entropy for commuting automorphisms of compact groups. Invent. Math., 101(3), 593-629.
Lothaire, M. 1983. Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 17. Addison-Wesley.
Lothaire, M. 1997. Combinatorics on Words, 2nd edition. Cambridge University Press.
Lothaire, M. 2002. Algebraic Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 90. Cambridge University Press.
Lothaire, M. 2005. Applied Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 105. Cambridge University Press.
Lü, F., Tan, B., andWu, J. 2014. Univoque sets for real numbers. Fund. Math., 227(1), 69-83.
Lucas, E. 1891. Théorie des nombres. Gauthier-Villars.
Lukkarila, V. 2009. The 4-way deterministic tiling problem is undecidable. Theoret. Comput. Sci., 410(16), 1516-1533.
MacDonald,M., and Ambrose, C.M. 1993. A novel gene containing a trinucleotide repeat that is expanded and unstable on Huntington's disease chromosomes. Cell, 72(6), 971-983.
Main, M. G. 1989. Detecting leftmost maximal periodicities. Discrete Appl. Math., 25, 145-153.
Main, M. G., and Lorentz, R. J. 1984. An O(nlogn) algorithm for finding all repetitions in a string. J. Algorithms, 5(3), 422-432.
Makover, E., and McGowan, J. 2006. An elementary proof that random Fibonacci sequences grow exponentially. J. Number Theory, 121, 40-44.
Maruoka, A., and Kimura, M. 1976. Condition for injectivity of global maps for tessellation automata. Information and Control, 32(2), 158-162.
Matsubara,W.,Kusano, K., Ishino, A., Bannai, H., and Shinohara, A. 2008. New lower bounds for the maximum number of runs in a string. Pages 140-145 of: Holub, J., and Zdárek, J. (eds.), Proceedings of the Prague Stringology Conference. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague.
Mauldin, R. D., and Simon, K. 1998. The equivalence of some Bernoulli convolutions to Lebesgue measure. Proc. Amer. Math. Soc., 126(9), 2733-2736.
Meyerovitch, T. 2010. Growth-type invariants for Zd subshifts of finite type and arithmetical classes of real numbers. To appear in Inventiones Mathematica.
Meyerovitch, T., and Pavlov, R. 2014. On independence and entropy for high-dimensional isotropic subshifts. Proc. Lond. Math. Soc. (3), 109(4), 921-945.
Mignosi, F., and Pirillo, G. 1992. Repetitions in the Fibonacci infinite word. RAIRO Inform. Théor. App., 26, 199-204.
Mignosi, F., Restivo, A., and Sciortino, M. 2002. Words and forbidden factors. Theoret. Comput. Sci., 273, 99-117.
Minkowski, H. 1904. Zur Geometrie der Zahlen. Pages 164-173 of: Verhandlungen des III. internationalen Mathematiker-Kongresses in Heidelberg.
Mohammad-Noori, M., and Currie, J. D. 2007. Dejean's conjecture and Sturmian words. European J. Combinatorics, 28, 876-890.
Moore, D., and Smyth, W. F. 1994. Computing the covers of a string in linear time. Pages 511-515 of: Sleator, D. D. (ed.), Proceedings of the Fifth Annual ACM-SIAMSymposium on Discrete Algorithms, SODA'94.
Moore, E. F. 1962. Machine models of self-reproduction. Pages 17-33 of: Bellman, R. (ed.), Mathematical Problems in Biological Sciences (Proceedings of Symposia in Applied Mathematics). American Mathematical Society.
Morier-Genoud, S. 2012. Arithmetics of 2-friezes. J. Algebraic Combin., 36(4), 515-539.
Morse, M. 1921. Recurrent geodesics on a surface of negative curvature. Trans. Amer. Math. Soc., 22, 84-100.
Moser, R., and Tardos, G. 2010. A constructive proof of the general Lovász local lemma. J. Assoc. Comput. Mach., 57, Article 11.
Moulin-Ollagnier, J. 1992. Proof of Dejean's conjecture for alphabets with 5,6,7,8,9,10 and 11 letters. Theoret. Comput. Sci., 95, 187-205.
Mousavi, H., and Shallit, J. 2014. Mechanical proofs of properties of the Tribonacci word. Available electronically at arXiv:1407.5841.
Muthukrishnan, S., and Ramesh, H. 1995. String matching under a general matching relation. Inform. and Comput., 122(1), 140-148.
Myers, D. 1974. Nonrecursive tilings of the plane. II. J. Symbolic Logic, 39, 286-294.
Myhill, J. 1963. The converse of Moore's Garden-of-Eden theorem. Proceedings of The American Mathematical Society, 14, 685-685.
Nicaud, C. 2014. Fast synchronization of random automata. Manuscript available electronically at arXiv:1404.6962.
Noonan, J., and Zeilberger, D. 1999. The Goulden-Jackson cluster method: extensions, applications and implementations. J. Diff. Equations. Appl., 5, 355-377.
Novikov, P. S., and Adian, S. I. 1968. Infinite periodic groups I, II, III. Izv. Akad. Nauk. SSSR Ser. Mat., 32, 212-244, 251-524, 709-731.
O'Brien, G. L. 1981. The road-colouring problem. Israel J. Math., 39(1-2), 145-154.
Ochem, P., Rampersad, N., and Shallit, J. 2008. Avoiding approximate squares. Internat. J. Found. Comp. Sci., 19, 633-648.
Ochem, P. 2006. A generator of morphisms for infinite words. ITA, 40(3), 427-441.
Pansiot, J.-J. 1981. The Morse sequence and iterated morphisms. Inf. Process. Lett., 12(2), 68-70.
Pansiot, J.-J. 1984. A propos d'une conjecture de F. Dejean sur les répétitions dans les mots. Discrete Appl. Math., 7, 297-311.
Parry, W. 1960. On the β-expansions of real numbers. Acta Math. Acad. Sci. Hungar., 11, 401-416.
Parry, W. 1964. Representations for real numbers. Acta Math. Acad. Sci. Hung., 15, 95-105.
Pavlov, R. 2012. Approximating the hard square entropy constant with probabilistic methods. Ann. Probab., 40(6), 2362-2399.
Pavlov, R., and Schraudner, M. 2015a. Classification of sofic projective subdynamics of multidimensional shifts of finite type. Trans. Amer. Math. Soc., 367(5), 3371-3421.
Pavlov, R., and Schraudner, M. 2015b. Entropies realizable by block gluing Zd shifts of finite type. J. Anal. Math., 126, 113-174.
Pedicini, M. 2005. Greedy expansions and sets with deleted digits. Theoret. Comput. Sci., 332(1-3), 313-336.
Pegden,W. 2011. Highly nonrepetitive sequences: winning strategies from the Local Lemma. Random Structures and Algorithms, 38, 140-161.
Perrin, D. 1995. Symbolic dynamics and finite automata. Pages 94-104 of: Wiedermann, J., and Hájek, P. (eds.), Proc. 20th Symposium, Mathematical Foundations of Computer Science 1995. Lecture Notes in Computer Science, vol. 969. Springer-Verlag.
Perrin, D., and Pin, J.-E. 2004. Infinite words. Automata, semigroups, logic and games. Amsterdam: Elsevier/Academic Press.
Perrin, D., and Schützenberger, M.-P. 1992. Synchronizing prefix codes and automata and the road coloring problem. Pages 295-318 of: Symbolic Dynamics and its Applications. Contemp. Math., vol. 135. Amer. Math. Soc.
Perron, O. 1913. Die Lehre von den Kettenbrüchen. Leipzig: B. G. Teubner.
Perron, O. 1960. Irrationalzahlen. Walter de Gruyter.
Petrov, A. N. 1988. A sequence that avoids every complete word. Mat. Zametki, 44, 517-522. Translation in Math. Notes 44 (1988), 764-767.
Pin, J.-E. 1978. Le problème de la synchronisation et la conjecture de Cérný. Thèse de 3ème cycle, Université ParisVI.
Pin, J.-E. 1983. On two combinatorial problems arising from automata theory. Pages 535-548 of: Combinatorial mathematics (Marseille-Luminy, 1981). North-Holland Math. Stud., vol. 75. North-Holland, Amsterdam.
Pleasants, P. A. B. 1970. Non-repetitive sequences. Proc. Cambridge Phil. Soc., 68, 267-274.
Prouhet, E. 1851. Mémoire sur quelques relations entre les puissances des nombres. C. R. Acad. Sci. Paris, 33, 225.
Puglisi, S. J., Simpson, J., and Smyth, W. F. 2008. How many runs can a string contain? Theoret. Comput. Sci., 401(1-3), 165-171.
Puzyna, J. 1898. Teorya funkcyj analitycznych, t. I.
Pytheas Fogg, N. 2002. Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Mathematics, vol. 1794. Springer-Verlag. Ed. by V. Berthé and S. Ferenczi and C. Mauduit and A. Siegel.
Queffélec, M. 1987. Substitution Dynamical Systems -Spectral Analysis. LectureNotes in Mathematics, vol. 1294. Springer-Verlag.
Rabin, M. O., and Scott, D. 1959. Finite automata and their decision problems. IBM J. Res. Develop., 3, 115-125.
Rademacher, H. 1964. Lectures on Elementary Number Theory. Blaisdell Publishing Company.
Rampersad, N. 2011. Further applications of a power series method for pattern avoidance. Electronic J. Combinatorics, 18, P134.
Rampersad, N., Shallit, J., and Shur, A. 2011. Fife's theorem for 7 3-powers. Pages 189-198 of: Ambroz, P., Holub, S., and Masakova, Z. (eds.), WORDS 2011.
Rampersad, N., Shallit, J., and Wang, M.-w. 2005. Avoiding large squares in infinite binary words. Theoret. Comput. Sci., 339(1), 19-34.
Rao, M. 2011. Last cases of Dejean's conjecture. Theoret. Comput. Sci., 412(27), 3010-3018.
Rauzy, G. 1984. Des mots en arithmétique. Pages 103-113 of: Journées d'Avignon: Théorie des Langages et Complexité des Algorithmes. Université Claude Bernard (Lyon), Publications du Département de Mathématiques.
Rényi, A. 1957. Representations for real numbers and their ergodic properties. Acta Math. Acad. Sci. Hung., 8, 477-493.
Restivo, A., and Salemi, S. 1985. Overlap free words on two symbols. Pages 198-206 of: Nivat, M., and Perrin, D. (eds.), Automata on Infinite Words. Lecture Notes in Computer Science, vol. 192. Springer-Verlag.
Reutenauer, C. 1997. N-rationality of zeta functions. Adv. in Appl. Math., 18(1), 1-17.
Richomme, G., Saari, K., and Zamboni, L. Q. 2011. Abelian complexity of minimal subshifts. J. Lond. Math. Soc. (2), 83(1), 79-95.
Rigo, M. 2014. Formal Languages, Automata and Numeration Systems, Introduction to Combinatorics on Words. Vol. 1. ISTE,Wiley.
Rittaud, B. 2007. On the average growth of random Fibonacci sequences. J. Integer Sequences, 10(07.2.4).
Rittaud, B. 2008. Suites de Fibonacci aléatoires et fractions continues de Rosen. Habilitation à diriger des recherches.
Robinson, R. M. 1971. Undecidability and nonperiodicity for tilings of the plane. Invent. Math., 12, 177-209.
Rogers, Jr., H. 1967. Theory of Recursive Functions and Effective Computability. NewYork: McGraw-Hill Book Co.
Rosen, D. 1954. A class of continued fractions associated with certain properly discontinuous groups. Duke Math. J., 21, 549-563.
Rowen, L. 1988. Ring Theory. Vol. II. Boston: Academic Press.
Ruelle, D. 1978. Thermodynamic Formalism. Addison Wesley.
Rytter, W. 2006. The Number of Runs in a String: Improved Analysis of the Linear Upper Bound. Pages 184-195 of: STACS.
Rytter, W. 2007. The number of runs in a string. Inf. Comput., 205(9), 1459-1469.
Saari, K. 2007. Everywhere a-repetitive sequences and Sturmian words. Pages 362-372 of: Diekert, V., Volkov, M., and Voronkov, A. (eds.), CSR 2007. Lecture Notes in Computer Science, vol. 4649. Springer-Verlag.
Sakarovitch, J. 2003. Éléments de theórie des automates. Vuibert. English corrected edition: Elements of Automata Theory, Cambridge University Press, 2009.
Sakarovitch, J. 2009. Elements of Automata Theory. Cambridge University Press.
Sardinas, A. A., and Patterson, C.W. 1953. A necessary and sufficient condition for the unique decomposition of coded messages. IRE Internat. Conv. Rec., 8, 104-108.
Schaeffer, L. 2013. Abelian powers in automatic sequences are not always automatic. Talk at CanadaDAM 2013 Conference, St. John's, Newfoundland (June 2013).
Schaeffer, L., and Shallit, J. 2012. The critical exponent is computable for automatic sequences. Internat. J. Found. Comput. Sci., 23(8), 1611-1626.
Schmidt, W. M. 1972. Irregularities of distribution VII. Acta Arith., 21, 45-50.
Schraudner, M. H. 2015. One-dimensional projective subdynamics of uniformly mixing Zd shifts of finite type. Ergodic Theory and Dynamical Systems, FirstView(3), 1-38.
Schützenberger, M.-P. 1967. On synchronizing prefix codes. Inform. and Control, 11, 396-401.
Schweiger, F. 1995. Ergodic Theory of Fibred Systems and Metric Number Theory. Clarendon Press.
Séébold, P. 1983. Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits. Pages 301-311 of: Cremers, A. B., and Kriegel, H. (eds.), Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings. Lecture Notes in Computer Science, vol. 145. Springer.
Shallit, J. 2004. Simultaneous avoidance of large squares and fractional powers in infinite binary words. Int. J. Found. Comput. Sci, 15, 317-327.
Shallit, J. 2008. A Second Course in Formal Languages and Automata Theory. Cambridge University Press.
Shallit, J. 2011. Fife's theorem revisited. Pages 397-405 of: Mauri, G., and Leporati, A. (eds.), DLT 2011. Lecture Notes in Computer Science, vol. 6795. Springer-Verlag.
Shallit, J. 2013. Decidability and enumeration for automatic sequences: a survey. Pages 49-63 of: Bulatov, A. A., and Shur, A. M. (eds.), CSR 2013. Lecture Notes in Computer Science, vol. 7913. Springer-Verlag.
Shmerkin, P. 2014. On the exceptional set for absolute continuity of Bernoulli convolutions. Geom. Funct. Anal., 24(3), 946-958.
Shur, A. M. 2000. The structure of the set of cube-free Z-words in a two-letter alphabet (Russian). Izv. Ross. Akad. Nauk Ser. Mat., 64, 201-224. English translation in Izv. Math. 64 (2000), 847-871.
Shur, A. 2012. Numerical values of the growth rates of power-free languages. Available electronically at arXiv:1009.4415.
Shur, A. M., and Gamzova, Y. V. 2004. Partial words and the period interaction property. Izv. Ross. Akad. Nauk Ser. Mat., 68(2), 191-214.
Sidorov, N. 2003a. Almost every number has a continuum of β-expansions. Amer. Math. Monthly, 110(9), 838-842.
Sidorov, N. 2003b. Arithmetic dynamics. Pages 145-189 of: Topics in Dynamics and Ergodic Theory. London Math. Soc. Lecture Note Ser., vol. 310. Cambridge University Press.
Sidorov, N. 2007. Combinatorics of linear iterated function systems with overlaps. Nonlinearity, 20(5), 1299-1312.
Sidorov, N. 2009. Expansions in non-integer bases: lower, middle and top orders. J. Number Theory, 129(4), 741-754.
Sierpiński,W. a. 1911. Sur quelques algorithmes pour développer les nombres réels en séries. C. R. Soc. Sci. Varsovie, 4, 56-77.
Simpson, J. 2010. Modified Padovan words and the maximum number of runs in a word. Australasian J. of Comb., 46, 129-145.
Simpson, S. G. 2014. Medvedev degrees of two-dimensional subshifts of finite type. Ergodic Theory Dynam. Systems, 34(2), 679-688.
Smyth, W. F. 2003. Computing Patterns in Strings. Pearson Education.
Solomyak, B. 1994. Conjugates of beta-numbers and the zero-free domain for a class of analytic functions. Proc. London Math. Soc. (3), 68(3), 477-498.
Solomyak, B. 1995. On the random series Σ±λn (an Erdos problem). Ann. of Math. (2), 142(3), 611-625.
Sós, V. T. 1958. On the distribution mod 1 of the sequence na. Ann. Univ. Sci. Budapest Eötvös Sect. Math., 1, 127-134.
Steinberg, B. 2011. The averaging trick and the Černý Conjecture. Int. J. Found. Comput. Sci., 22(7), 1697-1706.
Stern, M. 1858. Ueber eine zahlentheoritsche Funktion. J. Reine Angew. Math., 55, 193-220.
Sudkamp, T. A. 1997. Languages and Machines, An Introduction to the Theory of Computer Science. Addison-Wesley.
Surányi, J. 1958. On the distribution mod 1 of the sequence na. Ann. Univ. Sci. Budapest Eötvös Sect. Math., 1, 107-111.
Sutner, K. 1991. De Bruijn graphs and linear cellular automata. Complex Systems, 5(1), 19-30.
Świerczkowski, S. 1959. On successive settings of an arc on the circumference of a circle. Fund. Math., 46, 187-189.
Tamura, J.-I. 1985. Explicit formulae for Cantor series representing quadratic irrationals. Pages 369-381 of: Number Theory and Combinatorics. Japan 1984 (Tokyo, Okayama and Kyoto, 1984). World Scientific.
Thue, A. 1906a. Über unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl., 7, 1-22. Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell (ed.), Universitetsforlaget, Oslo, 1977, pp. 139-158.
Thue, A. 1906b. Uber unendliche Zeichenreihen. Norske vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana, 7, 1-22.
Thue, A. 1912. Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl., 1, 1-67. Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetsforlaget, Oslo, 1977, pp. 413-478.
Tijdeman, R., and Zamboni, L. Q. 2003. Fine and Wilf words for any periods. Indag. Math. (N.S.), 14(1), 135-147.
Trahtman, A. 2007. The Černý Conjecture for aperiodic automata. Discrete Math. & Theor. Comput. Sci., 9(2).
Trahtman, A. N. 2008. Synchronizing road coloring. Pages 43-53 of: Fifth IFIP International Conference on Theoretical Computer Science -TCS 2008. IFIP Int. Fed. Inf. Process., vol. 273. New York: Springer.
Trahtman, A. 2009. The road coloring problem. Israel J. Math., 172, 51-60.
Turing, A. M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc., 42, 230-265.
Vallée, B. 1997. Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes de Gauss et d'Euclid. Acta Arith., 81, 101-144.
Vallée, B. 1998. Dynamique des fractions continues à contraintes périodiques. J. Number Theory, 2, 183-235.
Vallée, B. 2006. Euclidean dynamics. Disc. and Cont. Dyn. Syst., 15(1), 281-352.
van Ravenstein, T. 1985. On the discrepancy of the sequence formed from multiples of an irrational number. Bull. Austral. Math. Soc., 329-338.
Vichniac, G. Y. 1984. Simulating physics with cellular automata. Physica D: Nonlinear Phenomena, 10(1-2), 96-116.
Vinberg, È. B. 1971. Discrete linear groups that are generated by reflections. Izv. Akad. Nauk SSSR Ser. Mat., 35, 1072-1112.
Viswanath, D. 2000. Random Fibonacci sequences and the number 1.13198824. . . Math. Comp., 69(231), 1131-1155.
Volkov, M. V. 2008. Synchronizing strongly connected digraphs. In: Around theČerný Conjecture, International Workshop. University of Wroclaw.
Volkov, M. V. 2009. Synchronizing automata preserving a chain of partial orders. Theoret. Comput. Sci., 410(37), 3513-3519.
Walters, P. 1982. An Introduction to Ergodic Theory. New York: Springer-Verlag.
Wang, H. 1961. Proving theorems by pattern recognition II. Bell System Technical Journal, 40, 1-42.
Weiss, B. 1973. Subshifts of finite type and sofic systems. Monatsh. Math., 77, 462-474.
Witten, I. H., Moffat, A., and Bell, T. C. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd Edition. Morgan Kaufmann.
Yu, S. 1997. Regular languages. Pages 41-110 of: Rozenberg, G., and Salomaa, A. (eds.), Handbook of Formal Languages, vol. 1. Springer-Verlag.
Zaremba, S. K. 1972. La méthode des "bons treillis" pour le calcul des intégrales multiples. Pages 39-119 of: Applications of Number Theory to Numerical Analysis (Proc. Sympos., Univ. Montreal, Montreal, Que., 1971). Academic Press.
Zheng, X., and Weihrauch, K. 2001. The arithmetical hierarchy of real numbers. MLQ Math. Log. Q., 47(1), 51-65.
Zimin, A. I. 1982. Blocking sets of terms. Mat. Sbornik, 119, 363-375, 447. In Russian. English translation in Math. USSR Sbornik, 47 (1984), 353-364.
Ziv, J., and Lempel, A. 1977. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3), 337-343.