Badkobeh, Golnaz; Charalampopoulos, Panagiotis; Kosolobov, Dmitry; Pissis, Solon P. Internal shortest absent word queries in constant time and linear space. (English) Zbl 07540210 Theor. Comput. Sci. 922, 271-282 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{G. Badkobeh} et al., Theor. Comput. Sci. 922, 271--282 (2022; Zbl 07540210) Full Text: DOI OpenURL
Lima, Yuri Symbolic dynamics for non-uniformly hyperbolic systems. (English) Zbl 1479.37016 Ergodic Theory Dyn. Syst. 41, No. 9, 2591-2658 (2021). Reviewer: Hasan Akin (Trieste) MSC: 37B10 37C05 37D25 37C35 37C83 37D35 PDF BibTeX XML Cite \textit{Y. Lima}, Ergodic Theory Dyn. Syst. 41, No. 9, 2591--2658 (2021; Zbl 1479.37016) Full Text: DOI arXiv OpenURL
Bezuglyi, Sergey; Karpel, Olena Invariant measures for Cantor dynamical systems. (English) Zbl 1447.37004 Moree, Pieter (ed.) et al., Dynamics: topology and numbers. Conference, Max Planck Institute for Mathematics, Bonn, Germany, July 2–6, 2018. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 744, 259-295 (2020). Reviewer: Hasan Akin (Gaziantep) MSC: 37A05 37B05 37B10 28D05 28C15 PDF BibTeX XML Cite \textit{S. Bezuglyi} and \textit{O. Karpel}, Contemp. Math. 744, 259--295 (2020; Zbl 1447.37004) Full Text: DOI arXiv OpenURL
Mauduit, Christian; Moreira, Carlos Gustavo Entropy ratio for infinite sequences with positive entropy. (English) Zbl 1437.37005 Ergodic Theory Dyn. Syst. 40, No. 3, 751-762 (2020). Reviewer: Hasan Akin (Gaziantep) MSC: 37A35 28D20 94A17 37B10 PDF BibTeX XML Cite \textit{C. Mauduit} and \textit{C. G. Moreira}, Ergodic Theory Dyn. Syst. 40, No. 3, 751--762 (2020; Zbl 1437.37005) Full Text: DOI arXiv OpenURL
Shallit, Jeffrey; Shur, Arseny Subword complexity and power avoidance. (English) Zbl 1447.68014 Theor. Comput. Sci. 792, 96-116 (2019). Reviewer: Wolfgang Steiner (Paris) MSC: 68R15 PDF BibTeX XML Cite \textit{J. Shallit} and \textit{A. Shur}, Theor. Comput. Sci. 792, 96--116 (2019; Zbl 1447.68014) Full Text: DOI arXiv OpenURL
Mauduit, Christian; Moreira, Carlos Gustavo Complexity and fractal dimensions for infinite sequences with positive entropy. (English) Zbl 1430.68254 Commun. Contemp. Math. 21, No. 6, Article ID 1850068, 19 p. (2019). MSC: 68R15 11K55 28A78 28D20 37B10 37B40 PDF BibTeX XML Cite \textit{C. Mauduit} and \textit{C. G. Moreira}, Commun. Contemp. Math. 21, No. 6, Article ID 1850068, 19 p. (2019; Zbl 1430.68254) Full Text: DOI arXiv OpenURL
Ferenczi, Sébastien; Mauduit, Christian; Moreira, Carlos Gustavo An algorithm for the word entropy. (English) Zbl 1398.68415 Theor. Comput. Sci. 743, 1-11 (2018). MSC: 68R15 37B10 PDF BibTeX XML Cite \textit{S. Ferenczi} et al., Theor. Comput. Sci. 743, 1--11 (2018; Zbl 1398.68415) Full Text: DOI arXiv HAL OpenURL
Artigue, A.; Carrasco-Olivera, D.; Monteverde, I. Polynomial entropy and expansivity. (English) Zbl 1399.37007 Acta Math. Hung. 152, No. 1, 140-149 (2017). Reviewer: Thomas B. Ward (Leeds) MSC: 37B40 28D20 37B10 54H20 PDF BibTeX XML Cite \textit{A. Artigue} et al., Acta Math. Hung. 152, No. 1, 140--149 (2017; Zbl 1399.37007) Full Text: DOI arXiv OpenURL
Nekrashevych, Volodymyr Growth of étale groupoids and simple algebras. (English) Zbl 1366.16016 Int. J. Algebra Comput. 26, No. 2, 375-397 (2016). Reviewer: Victor Petrogradsky (Brasilia) MSC: 16P90 22A22 20L05 PDF BibTeX XML Cite \textit{V. Nekrashevych}, Int. J. Algebra Comput. 26, No. 2, 375--397 (2016; Zbl 1366.16016) Full Text: DOI arXiv OpenURL
Bezuglyi, S.; Karpel, O. Orbit equivalent substitution dynamical systems and complexity. (English) Zbl 1317.37015 Proc. Am. Math. Soc. 142, No. 12, 4155-4169 (2014). Reviewer: Thomas B. Ward (Durham) MSC: 37B10 37A20 37B05 PDF BibTeX XML Cite \textit{S. Bezuglyi} and \textit{O. Karpel}, Proc. Am. Math. Soc. 142, No. 12, 4155--4169 (2014; Zbl 1317.37015) Full Text: DOI arXiv OpenURL
Lopez, Luis-Miguel; Narbel, Philippe Lamination languages. (English) Zbl 1280.05068 Ergodic Theory Dyn. Syst. 33, No. 6, 1813-1863 (2013). MSC: 05C38 05C60 57N05 57R50 PDF BibTeX XML Cite \textit{L.-M. Lopez} and \textit{P. Narbel}, Ergodic Theory Dyn. Syst. 33, No. 6, 1813--1863 (2013; Zbl 1280.05068) Full Text: DOI OpenURL
Lima, R.; Meyroneinc, A.; Ugalde, E. Dynamic modularity in discrete-time models of regulatory networks. (English) Zbl 1402.92202 Chaos Solitons Fractals 45, No. 5, 561-576 (2012). MSC: 92C42 PDF BibTeX XML Cite \textit{R. Lima} et al., Chaos Solitons Fractals 45, No. 5, 561--576 (2012; Zbl 1402.92202) Full Text: DOI Link OpenURL
Blanchet-Sadri, F. Algorithmic combinatorics on partial words. (English) Zbl 1266.68145 Int. J. Found. Comput. Sci. 23, No. 6, 1189-1206 (2012). MSC: 68R15 68P30 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri}, Int. J. Found. Comput. Sci. 23, No. 6, 1189--1206 (2012; Zbl 1266.68145) Full Text: DOI OpenURL
Mauduit, Christian; Moreira, Carlos Gustavo Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion. (English) Zbl 1258.11078 Ergodic Theory Dyn. Syst. 32, No. 3, 1073-1089 (2012). Reviewer: Jean-Paul Allouche (Paris) MSC: 11K55 28A78 37C45 PDF BibTeX XML Cite \textit{C. Mauduit} and \textit{C. G. Moreira}, Ergodic Theory Dyn. Syst. 32, No. 3, 1073--1089 (2012; Zbl 1258.11078) Full Text: DOI OpenURL
Ferenczi, Sébastien; Hubert, Pascal Three complexity functions. (English) Zbl 1271.37012 RAIRO, Theor. Inform. Appl. 46, No. 1, 67-76 (2012). MSC: 37B10 68R15 PDF BibTeX XML Cite \textit{S. Ferenczi} and \textit{P. Hubert}, RAIRO, Theor. Inform. Appl. 46, No. 1, 67--76 (2012; Zbl 1271.37012) Full Text: DOI EuDML HAL OpenURL
Blanchet-Sadri, F.; Chakarov, Aleksandar; Manuelli, Lucas; Schwartz, Jarett; Stich, Slater Constructing partial words with subword complexities not achievable by full words. (English) Zbl 1244.68063 Theor. Comput. Sci. 432, 21-27 (2012). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 432, 21--27 (2012; Zbl 1244.68063) Full Text: DOI OpenURL
Almeida, Jorge; Costa, Alfredo On the transition semigroups of centrally labeled Rauzy graphs. (English) Zbl 1256.20052 Int. J. Algebra Comput. 22, No. 2, 1250018, 25 p. (2012). Reviewer: Mikhail Volkov (Ekaterinburg) MSC: 20M05 20M07 20M35 37B10 68Q45 PDF BibTeX XML Cite \textit{J. Almeida} and \textit{A. Costa}, Int. J. Algebra Comput. 22, No. 2, 1250018, 25 p. (2012; Zbl 1256.20052) Full Text: DOI OpenURL
Le Gonidec, Marion On the complexity of a family of \(k\)-context-free sequences. (English) Zbl 1239.68057 Theor. Comput. Sci. 414, No. 1, 47-54 (2012). Reviewer: Anton Cerny (Safat) MSC: 68R15 68Q45 68Q19 PDF BibTeX XML Cite \textit{M. Le Gonidec}, Theor. Comput. Sci. 414, No. 1, 47--54 (2012; Zbl 1239.68057) Full Text: DOI OpenURL
Kamae, Teturo; Salimov, Pavel V. On maximal pattern complexity of some automatic words. (English) Zbl 1226.68077 Ergodic Theory Dyn. Syst. 31, No. 5, 1463-1470 (2011). MSC: 68R15 37B10 PDF BibTeX XML Cite \textit{T. Kamae} and \textit{P. V. Salimov}, Ergodic Theory Dyn. Syst. 31, No. 5, 1463--1470 (2011; Zbl 1226.68077) Full Text: DOI OpenURL
Goldstein, Ilya Subword complexity of uniform D0L words over finite groups. (English) Zbl 1251.68131 Theor. Comput. Sci. 412, No. 41, 5728-5743 (2011). MSC: 68Q45 PDF BibTeX XML Cite \textit{I. Goldstein}, Theor. Comput. Sci. 412, No. 41, 5728--5743 (2011; Zbl 1251.68131) Full Text: DOI OpenURL
Avgustinovich, S. V.; Frid, A.; Kamae, T.; Salimov, P. Infinite permutations of lowest maximal pattern complexity. (English) Zbl 1232.68095 Theor. Comput. Sci. 412, No. 27, 2911-2921 (2011). Reviewer: Anton Cerny (Safat) MSC: 68R15 05A05 PDF BibTeX XML Cite \textit{S. V. Avgustinovich} et al., Theor. Comput. Sci. 412, No. 27, 2911--2921 (2011; Zbl 1232.68095) Full Text: DOI arXiv OpenURL
Cassaigne, J.; Frid, A. E.; Petrov, F. V. On possible growths of Toeplitz languages. (English. Russian original) Zbl 1215.68191 Sib. Math. J. 52, No. 1, 63-73 (2011); translation from Sib. Mat. Zh. 52, No. 1, 81-94 (2011). MSC: 68R15 68Q25 68Q45 PDF BibTeX XML Cite \textit{J. Cassaigne} et al., Sib. Math. J. 52, No. 1, 63--73 (2011; Zbl 1215.68191); translation from Sib. Mat. Zh. 52, No. 1, 81--94 (2011) Full Text: DOI arXiv OpenURL
Blanchet-Sadri, F.; Lensmire, John On minimal Sturmian partial words. (English) Zbl 1217.68165 Discrete Appl. Math. 159, No. 8, 733-745 (2011). Reviewer: Jeffrey Shallit (Waterloo) MSC: 68R15 68Q45 11Y16 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} and \textit{J. Lensmire}, Discrete Appl. Math. 159, No. 8, 733--745 (2011; Zbl 1217.68165) Full Text: DOI Link OpenURL
Merekin, Yu. V. On the computational complexity of the Arnold complexity of binary words. (English) Zbl 1184.68376 Asian-Eur. J. Math. 2, No. 4, 649-656 (2009). MSC: 68R15 68Q17 PDF BibTeX XML Cite \textit{Yu. V. Merekin}, Asian-Eur. J. Math. 2, No. 4, 649--656 (2009; Zbl 1184.68376) Full Text: DOI OpenURL
Kamae, Teturo Uniform sets and complexity. (English) Zbl 1204.68150 Discrete Math. 309, No. 12, 3738-3747 (2009). MSC: 68R15 68Q17 PDF BibTeX XML Cite \textit{T. Kamae}, Discrete Math. 309, No. 12, 3738--3747 (2009; Zbl 1204.68150) Full Text: DOI OpenURL
Nicolas, Francois; Pritykin, Yuri On uniformly recurrent morphic sequences. (English) Zbl 1187.68368 Int. J. Found. Comput. Sci. 20, No. 5, 919-940 (2009). MSC: 68R15 03D40 08A50 68Q25 PDF BibTeX XML Cite \textit{F. Nicolas} and \textit{Y. Pritykin}, Int. J. Found. Comput. Sci. 20, No. 5, 919--940 (2009; Zbl 1187.68368) Full Text: DOI OpenURL
Moshe, Yossi On the joint subword complexity of automatic sequences. (English) Zbl 1172.68036 Theor. Comput. Sci. 410, No. 38-40, 3573-3588 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{Y. Moshe}, Theor. Comput. Sci. 410, No. 38--40, 3573--3588 (2009; Zbl 1172.68036) Full Text: DOI OpenURL
Glen, Amy; Justin, Jacques Episturmian words: a survey. (English) Zbl 1182.68155 Theor. Inform. Appl. 43, No. 3, 403-442 (2009). MSC: 68R15 PDF BibTeX XML Cite \textit{A. Glen} and \textit{J. Justin}, Theor. Inform. Appl. 43, No. 3, 403--442 (2009; Zbl 1182.68155) Full Text: DOI arXiv EuDML Link OpenURL
Goldstein, Ilya Asymptotic subword complexity of fixed points of group substitutions. (English) Zbl 1168.68025 Theor. Comput. Sci. 410, No. 21-23, 2084-2098 (2009). MSC: 68Q45 68Q70 68R15 PDF BibTeX XML Cite \textit{I. Goldstein}, Theor. Comput. Sci. 410, No. 21--23, 2084--2098 (2009; Zbl 1168.68025) Full Text: DOI OpenURL
Glen, Amy; Levé, Florence; Richomme, Gwénaël Directive words of episturmian words: equivalences and normalization. (English) Zbl 1166.68034 Theor. Inform. Appl. 43, No. 2, 299-319 (2009). MSC: 68R15 PDF BibTeX XML Cite \textit{A. Glen} et al., Theor. Inform. Appl. 43, No. 2, 299--319 (2009; Zbl 1166.68034) Full Text: DOI arXiv EuDML Link OpenURL
Salimov, Paul V. Constructing infinite words of intermediate arithmetical complexity. (English) Zbl 1234.68333 Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 696-701 (2009). MSC: 68R15 PDF BibTeX XML Cite \textit{P. V. Salimov}, Lect. Notes Comput. Sci. 5457, 696--701 (2009; Zbl 1234.68333) Full Text: DOI OpenURL
Glen, Amy; Levé, Florence; Richomme, Gwénaël Quasiperiodic and Lyndon episturmian words. (English) Zbl 1155.68065 Theor. Comput. Sci. 409, No. 3, 578-600 (2008). MSC: 68R15 PDF BibTeX XML Cite \textit{A. Glen} et al., Theor. Comput. Sci. 409, No. 3, 578--600 (2008; Zbl 1155.68065) Full Text: DOI arXiv Link OpenURL
Le Gonidec, Marion On complexity functions of infinite words associated with generalized Dyck languages. (English) Zbl 1152.68030 Theor. Comput. Sci. 407, No. 1-3, 117-133 (2008). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Le Gonidec}, Theor. Comput. Sci. 407, No. 1--3, 117--133 (2008; Zbl 1152.68030) Full Text: DOI OpenURL
Le Gonidec, Marion Drunken man infinite words complexity. (English) Zbl 1188.68217 Theor. Inform. Appl. 42, No. 3, 599-613 (2008). Reviewer: Jean-Paul Allouche (Orsay) MSC: 68R15 11B85 68Q17 PDF BibTeX XML Cite \textit{M. Le Gonidec}, Theor. Inform. Appl. 42, No. 3, 599--613 (2008; Zbl 1188.68217) Full Text: DOI EuDML Link OpenURL
Moshe, Yossi On the subword complexity of Thue-Morse polynomial extractions. (English) Zbl 1135.68046 Theor. Comput. Sci. 389, No. 1-2, 318-329 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{Y. Moshe}, Theor. Comput. Sci. 389, No. 1--2, 318--329 (2007; Zbl 1135.68046) Full Text: DOI OpenURL
Tan, Bo Mirror substitutions and palindromic sequences. (English) Zbl 1143.68063 Theor. Comput. Sci. 389, No. 1-2, 118-124 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{B. Tan}, Theor. Comput. Sci. 389, No. 1--2, 118--124 (2007; Zbl 1143.68063) Full Text: DOI OpenURL
Bernat, Julien; Masáková, Zuzana; Pelantová, Edita On a class of infinite words with affine factor complexity. (English) Zbl 1143.68062 Theor. Comput. Sci. 389, No. 1-2, 12-25 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{J. Bernat} et al., Theor. Comput. Sci. 389, No. 1--2, 12--25 (2007; Zbl 1143.68062) Full Text: DOI arXiv OpenURL
Fon-Der-Flaass, D. G.; Frid, A. E. On periodicity and low complexity of infinite permutations. (English) Zbl 1126.05004 Eur. J. Comb. 28, No. 8, 2106-2114 (2007). MSC: 05A05 PDF BibTeX XML Cite \textit{D. G. Fon-Der-Flaass} and \textit{A. E. Frid}, Eur. J. Comb. 28, No. 8, 2106--2114 (2007; Zbl 1126.05004) Full Text: DOI OpenURL
Cassaigne, J.; Frid, A. E. On the arithmetical complexity of Sturmian words. (English) Zbl 1119.68138 Theor. Comput. Sci. 380, No. 3, 304-316 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{J. Cassaigne} and \textit{A. E. Frid}, Theor. Comput. Sci. 380, No. 3, 304--316 (2007; Zbl 1119.68138) Full Text: DOI OpenURL
Gheorghiciuc, Irina The subword complexity of a class of infinite binary words. (English) Zbl 1117.68059 Adv. Appl. Math. 39, No. 2, 237-259 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{I. Gheorghiciuc}, Adv. Appl. Math. 39, No. 2, 237--259 (2007; Zbl 1117.68059) Full Text: DOI arXiv OpenURL
Levé, F.; Richomme, G. Quasiperiodic Sturmian words and morphisms. (English) Zbl 1108.68097 Theor. Comput. Sci. 372, No. 1, 15-25 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{F. Levé} and \textit{G. Richomme}, Theor. Comput. Sci. 372, No. 1, 15--25 (2007; Zbl 1108.68097) Full Text: DOI OpenURL
Ferenczi, Sébastien Substitution dynamical systems on infinite alphabets. (English. French summary) Zbl 1147.37007 Ann. Inst. Fourier 56, No. 7, 2315-2343 (2006). MSC: 37B10 37A05 37A40 PDF BibTeX XML Cite \textit{S. Ferenczi}, Ann. Inst. Fourier 56, No. 7, 2315--2343 (2006; Zbl 1147.37007) Full Text: DOI Numdam Numdam EuDML OpenURL
Avgustinovich, Sergey V.; Cassaigne, Julien; Frid, Anna E. Sequences of low arithmetical complexity. (English) Zbl 1110.68116 Theor. Inform. Appl. 40, No. 4, 569-582 (2006). MSC: 68R15 PDF BibTeX XML Cite \textit{S. V. Avgustinovich} et al., Theor. Inform. Appl. 40, No. 4, 569--582 (2006; Zbl 1110.68116) Full Text: DOI Numdam EuDML Link OpenURL
Frid, Anna E. On possible growths of arithmetical complexity. (English) Zbl 1110.68120 Theor. Inform. Appl. 40, No. 3, 443-458 (2006). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{A. E. Frid}, Theor. Inform. Appl. 40, No. 3, 443--458 (2006; Zbl 1110.68120) Full Text: DOI Numdam EuDML Link OpenURL
Kamae, Teturo; Rao, Hui; Tan, Bo; Xue, Yu-Mei Language structure of pattern Sturmian words. (English) Zbl 1097.68111 Discrete Math. 306, No. 15, 1651-1668 (2006). MSC: 68R15 PDF BibTeX XML Cite \textit{T. Kamae} et al., Discrete Math. 306, No. 15, 1651--1668 (2006; Zbl 1097.68111) Full Text: DOI OpenURL
Almeida, J.; Volkov, M. V. Subword complexity of profinite words and subgroups of free profinite semigroups. (English) Zbl 1186.20040 Int. J. Algebra Comput. 16, No. 2, 221-258 (2006). MSC: 20M05 37B10 20M07 68R15 PDF BibTeX XML Cite \textit{J. Almeida} and \textit{M. V. Volkov}, Int. J. Algebra Comput. 16, No. 2, 221--258 (2006; Zbl 1186.20040) Full Text: DOI OpenURL
Frid, A. E. Sequences of linear arithmetical complexity. (English) Zbl 1076.68053 Theor. Comput. Sci. 339, No. 1, 68-87 (2005). MSC: 68R15 PDF BibTeX XML Cite \textit{A. E. Frid}, Theor. Comput. Sci. 339, No. 1, 68--87 (2005; Zbl 1076.68053) Full Text: DOI OpenURL
Balogh, József; Bollobás, Béla Hereditary properties of words. (English) Zbl 1132.68048 Theor. Inform. Appl. 39, No. 1, 49-65 (2005). Reviewer: Václav Koubek (Praha) MSC: 68R15 37B10 05A05 PDF BibTeX XML Cite \textit{J. Balogh} and \textit{B. Bollobás}, Theor. Inform. Appl. 39, No. 1, 49--65 (2005; Zbl 1132.68048) Full Text: DOI Numdam EuDML Link OpenURL
Fraenkel, Aviezri S.; Simpson, Jamie An extension of the periodicity lemma to longer periods. (English) Zbl 1084.68092 Discrete Appl. Math. 146, No. 2, 146-155 (2005). MSC: 68R15 05A05 PDF BibTeX XML Cite \textit{A. S. Fraenkel} and \textit{J. Simpson}, Discrete Appl. Math. 146, No. 2, 146--155 (2005; Zbl 1084.68092) Full Text: DOI OpenURL
Afraimovich, V.; Zaslavsky, G. M. Space-time complexity in Hamiltonian dynamics. (English) Zbl 1080.37581 Chaos 13, No. 2, 519-532 (2003). MSC: 37J99 37B99 37D99 PDF BibTeX XML Cite \textit{V. Afraimovich} and \textit{G. M. Zaslavsky}, Chaos 13, No. 2, 519--532 (2003; Zbl 1080.37581) Full Text: DOI arXiv OpenURL
Sidorov, N. Universal \(\beta\)-expansions. (English) Zbl 1049.11009 Period. Math. Hung. 47, No. 1-2, 221-231 (2003). Reviewer: Władisław Narkiewicz (Wrocław) MSC: 11A63 28D05 PDF BibTeX XML Cite \textit{N. Sidorov}, Period. Math. Hung. 47, No. 1--2, 221--231 (2003; Zbl 1049.11009) Full Text: DOI OpenURL
Frid, A. E. Arithmetical complexity of symmetric D0L words. (English) Zbl 1070.68068 Theor. Comput. Sci. 306, No. 1-3, 535-542 (2003). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. E. Frid}, Theor. Comput. Sci. 306, No. 1--3, 535--542 (2003; Zbl 1070.68068) Full Text: DOI OpenURL
Afraimovich, V.; Urías, J. Some characteristics of complex behavior of orbits in dynamical systems. (English) Zbl 1029.37006 Commun. Nonlinear Sci. Numer. Simul. 8, No. 3-4, 171-181 (2003). MSC: 37B10 37D45 PDF BibTeX XML Cite \textit{V. Afraimovich} and \textit{J. Urías}, Commun. Nonlinear Sci. Numer. Simul. 8, No. 3--4, 171--181 (2003; Zbl 1029.37006) Full Text: DOI OpenURL
Allouche, Jean-Paul; Baake, Michael; Cassaigne, Julien; Damanik, David Palindrome complexity. (English) Zbl 1064.68074 Theor. Comput. Sci. 292, No. 1, 9-31 (2003). MSC: 68R15 PDF BibTeX XML Cite \textit{J.-P. Allouche} et al., Theor. Comput. Sci. 292, No. 1, 9--31 (2003; Zbl 1064.68074) Full Text: DOI arXiv OpenURL
Berthé, Valérie; Vuillon, Laurent Double sequences of low complexity. (Suites doubles de basse complexité.) (French) Zbl 1018.37010 J. Théor. Nombres Bordx. 12, No. 1, 179-208 (2000). Reviewer: Jean-Paul Allouche (Orsay) MSC: 37B10 11B83 68R15 PDF BibTeX XML Cite \textit{V. Berthé} and \textit{L. Vuillon}, J. Théor. Nombres Bordx. 12, No. 1, 179--208 (2000; Zbl 1018.37010) Full Text: DOI Numdam EuDML OpenURL
Ferenczi, Sébastien; Kása, Zoltán Complexity for finite factors of infinite sequences. (English) Zbl 0916.68112 Theor. Comput. Sci. 218, No. 1, 177-195 (1999). MSC: 68R15 PDF BibTeX XML Cite \textit{S. Ferenczi} and \textit{Z. Kása}, Theor. Comput. Sci. 218, No. 1, 177--195 (1999; Zbl 0916.68112) Full Text: DOI OpenURL