Aloui, Karam On the correlation of the Thue-Morse sequence. (English) Zbl 07540784 Ramanujan J. 58, No. 3, 771-799 (2022). MSC: 11A63 11B85 11L03 11L07 11N25 PDF BibTeX XML Cite \textit{K. Aloui}, Ramanujan J. 58, No. 3, 771--799 (2022; Zbl 07540784) Full Text: DOI OpenURL
Badkobeh, Golnaz; Harju, Tero; Ochem, Pascal; Rosenfeld, Matthieu Avoiding square-free words on free groups. (English) Zbl 07540206 Theor. Comput. Sci. 922, 206-217 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{G. Badkobeh} et al., Theor. Comput. Sci. 922, 206--217 (2022; Zbl 07540206) Full Text: DOI OpenURL
Dvořáková, L’ubomíra; Pelantová, Edita; Opočenská, Daniela; Shur, Arseny M. On minimal critical exponent of balanced sequences. (English) Zbl 07540202 Theor. Comput. Sci. 922, 158-169 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. Dvořáková} et al., Theor. Comput. Sci. 922, 158--169 (2022; Zbl 07540202) Full Text: DOI OpenURL
Chybowska-Sokół, Joanna; Dębski, Michał; Grytczuk, Jarosław; Junosza-Szaniawski, Konstanty; Nayar, Barbara; Pastwa, Urszula; Węsek, Krzysztof Fractional meanings of nonrepetitiveness. (English) Zbl 1483.68270 J. Comb. Theory, Ser. A 189, Article ID 105598, 22 p. (2022). MSC: 68R15 05A05 05A15 PDF BibTeX XML Cite \textit{J. Chybowska-Sokół} et al., J. Comb. Theory, Ser. A 189, Article ID 105598, 22 p. (2022; Zbl 1483.68270) Full Text: DOI OpenURL
Luchinin, Sergey; Puzynina, Svetlana Symmetry groups of infinite words. (English) Zbl 07498732 Moreira, Nelma (ed.) et al., Developments in language theory. 25th international conference, DLT 2021, Porto, Portugal, August 16–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12811, 267-278 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{S. Luchinin} and \textit{S. Puzynina}, Lect. Notes Comput. Sci. 12811, 267--278 (2021; Zbl 07498732) Full Text: DOI OpenURL
Allouche, Jean-Paul Morphic sequences versus automatic sequences. (English) Zbl 07498711 Moreira, Nelma (ed.) et al., Developments in language theory. 25th international conference, DLT 2021, Porto, Portugal, August 16–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12811, 3-11 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{J.-P. Allouche}, Lect. Notes Comput. Sci. 12811, 3--11 (2021; Zbl 07498711) Full Text: DOI OpenURL
Li, Yao-Qiang Generalized Koch curves and Thue-Morse sequences. (English) Zbl 1483.11047 Fractals 29, No. 6, Article ID 2150130, 15 p. (2021). MSC: 11B85 11B83 28A75 28A80 PDF BibTeX XML Cite \textit{Y.-Q. Li}, Fractals 29, No. 6, Article ID 2150130, 15 p. (2021; Zbl 1483.11047) Full Text: DOI arXiv OpenURL
Gabric, Daniel; Shallit, Jeffrey The simplest binary word with only three squares. (English) Zbl 07455931 RAIRO, Theor. Inform. Appl. 55, Paper No. 3, 7 p. (2021). MSC: 68R15 PDF BibTeX XML Cite \textit{D. Gabric} and \textit{J. Shallit}, RAIRO, Theor. Inform. Appl. 55, Paper No. 3, 7 p. (2021; Zbl 07455931) Full Text: DOI arXiv OpenURL
Rosenfeld, Matthieu Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge. (English) Zbl 1478.05057 Electron. J. Comb. 28, No. 4, Research Paper P4.19, 16 p. (2021). MSC: 05C15 68R15 PDF BibTeX XML Cite \textit{M. Rosenfeld}, Electron. J. Comb. 28, No. 4, Research Paper P4.19, 16 p. (2021; Zbl 1478.05057) Full Text: DOI arXiv OpenURL
Petrova, Elena A.; Shur, Arseny M. Transition property for cube-free words. (English) Zbl 07377739 Theory Comput. Syst. 65, No. 3, 479-496 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. A. Petrova} and \textit{A. M. Shur}, Theory Comput. Syst. 65, No. 3, 479--496 (2021; Zbl 07377739) Full Text: DOI OpenURL
Gaetz, Marisa Anti-power \(j\)-fixes of the Thue-Morse word. (English) Zbl 1471.68213 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 5, 21 p. (2021). Reviewer: Anna Frid (Marseille) MSC: 68R15 PDF BibTeX XML Cite \textit{M. Gaetz}, Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 5, 21 p. (2021; Zbl 1471.68213) Full Text: DOI arXiv Link OpenURL
Richomme, Gwenaël On sets of indefinitely desubstitutable words. (English) Zbl 1477.68256 Theor. Comput. Sci. 857, 97-113 (2021). MSC: 68R15 PDF BibTeX XML Cite \textit{G. Richomme}, Theor. Comput. Sci. 857, 97--113 (2021; Zbl 1477.68256) Full Text: DOI arXiv OpenURL
Currie, James D.; Johnson, Jesse T. Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101. (English) Zbl 1479.68003 Theor. Comput. Sci. 850, 30-39 (2021). Reviewer: Jeffrey Shallit (Waterloo) MSC: 68R15 PDF BibTeX XML Cite \textit{J. D. Currie} and \textit{J. T. Johnson}, Theor. Comput. Sci. 850, 30--39 (2021; Zbl 1479.68003) Full Text: DOI arXiv OpenURL
Gabric, Daniel; Shallit, Jeffrey; Zhong, Xiao Feng Avoidance of split overlaps. (English) Zbl 1462.68150 Discrete Math. 344, No. 2, Article ID 112176, 8 p. (2021). Reviewer: Anna Frid (Marseille) MSC: 68R15 PDF BibTeX XML Cite \textit{D. Gabric} et al., Discrete Math. 344, No. 2, Article ID 112176, 8 p. (2021; Zbl 1462.68150) Full Text: DOI arXiv OpenURL
Hu, Yining; Wei-Han, Guoniu On the automaticity of sequences defined by the Thue-Morse and period-doubling Stieltjes continued fractions. (English) Zbl 1460.11034 Int. J. Number Theory 16, No. 10, 2187-2212 (2020). Reviewer: Jean-Paul Allouche (Paris) MSC: 11B85 11J70 11B50 11Y65 05A15 PDF BibTeX XML Cite \textit{Y. Hu} and \textit{G. Wei-Han}, Int. J. Number Theory 16, No. 10, 2187--2212 (2020; Zbl 1460.11034) Full Text: DOI OpenURL
Rajasekaran, Aayush; Shallit, Jeffrey; Smith, Tim Additive number theory via automata theory. (English) Zbl 1475.11040 Theory Comput. Syst. 64, No. 3, 542-567 (2020). Reviewer: Volker Ziegler (Salzburg) MSC: 11B85 11A63 68Q45 PDF BibTeX XML Cite \textit{A. Rajasekaran} et al., Theory Comput. Syst. 64, No. 3, 542--567 (2020; Zbl 1475.11040) Full Text: DOI OpenURL
Ochem, Pascal; Rosenfeld, Matthieu On some interesting ternary formulas. (English) Zbl 1419.68070 Electron. J. Comb. 26, No. 1, Research Paper P1.12, 10 p. (2019). Reviewer: Anna Frid (Marseille) MSC: 68R15 PDF BibTeX XML Cite \textit{P. Ochem} and \textit{M. Rosenfeld}, Electron. J. Comb. 26, No. 1, Research Paper P1.12, 10 p. (2019; Zbl 1419.68070) Full Text: Link OpenURL
Kenkireth, Benny George; Singh, Mrityunjay On the minimal alphabet size in multidimensional unrepetitive configurations. (English) Zbl 1417.68169 Discrete Appl. Math. 255, 258-266 (2019). MSC: 68R15 PDF BibTeX XML Cite \textit{B. G. Kenkireth} and \textit{M. Singh}, Discrete Appl. Math. 255, 258--266 (2019; Zbl 1417.68169) Full Text: DOI OpenURL
Wojcik, Caïus; Zamboni, Luca Q. Coloring problems for infinite words. (English) Zbl 1405.05005 Berthé, Valérie (ed.) et al., Sequences, groups, and number theory. Cham: Birkhäuser (ISBN 978-3-319-69151-0/hbk; 978-3-319-69152-7/ebook). Trends in Mathematics, 213-231 (2018). MSC: 05A05 05A18 PDF BibTeX XML Cite \textit{C. Wojcik} and \textit{L. Q. Zamboni}, in: Sequences, groups, and number theory. Cham: Birkhäuser. 213--231 (2018; Zbl 1405.05005) Full Text: DOI OpenURL
Ochem, Pascal; Rao, Michaël; Rosenfeld, Matthieu Avoiding or limiting regularities in words. (English) Zbl 1405.05004 Berthé, Valérie (ed.) et al., Sequences, groups, and number theory. Cham: Birkhäuser (ISBN 978-3-319-69151-0/hbk; 978-3-319-69152-7/ebook). Trends in Mathematics, 177-212 (2018). MSC: 05A05 PDF BibTeX XML Cite \textit{P. Ochem} et al., in: Sequences, groups, and number theory. Cham: Birkhäuser. 177--212 (2018; Zbl 1405.05004) Full Text: DOI OpenURL
Berthé, Valérie; Rigo, Michel General framework. (English) Zbl 1407.11044 Berthé, Valérie (ed.) et al., Sequences, groups, and number theory. Cham: Birkhäuser. Trends Math., 1-36 (2018). MSC: 11B85 11-02 05A05 11A63 68Q45 PDF BibTeX XML Cite \textit{V. Berthé} and \textit{M. Rigo}, in: Sequences, groups, and number theory. Cham: Birkhäuser. 1--36 (2018; Zbl 1407.11044) Full Text: DOI OpenURL
Bille, Philip; Gagie, Travis; Gørtz, Inge Li; Prezza, Nicola A separation between RLSLPs and LZ77. (English) Zbl 06993620 J. Discrete Algorithms 50, 36-39 (2018). MSC: 68P30 68P05 68Q42 68R15 PDF BibTeX XML Cite \textit{P. Bille} et al., J. Discrete Algorithms 50, 36--39 (2018; Zbl 06993620) Full Text: DOI Link OpenURL
Kotlyarov, N. V. Existence of words over three-letter alphabet not containing squares with replacement errors. (Existence of words over tree-letter alphabet not containing squares with replacement errors.) (English. Russian original) Zbl 1408.68124 Mosc. Univ. Math. Bull. 73, No. 3, 90-97 (2018); translation from Vestn. Mosk. Univ., Ser. I 73, No. 3, 8-16 (2018). Reviewer: Anton Černý (Safat) MSC: 68R15 PDF BibTeX XML Cite \textit{N. V. Kotlyarov}, Mosc. Univ. Math. Bull. 73, No. 3, 90--97 (2018; Zbl 1408.68124); translation from Vestn. Mosk. Univ., Ser. I 73, No. 3, 8--16 (2018) Full Text: DOI OpenURL
Gasnikov, Daniil; Shur, Arseny M. Square-free partial words with many wildcards. (English) Zbl 1408.68123 Int. J. Found. Comput. Sci. 29, No. 5, 845-860 (2018). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 68R15 PDF BibTeX XML Cite \textit{D. Gasnikov} and \textit{A. M. Shur}, Int. J. Found. Comput. Sci. 29, No. 5, 845--860 (2018; Zbl 1408.68123) Full Text: DOI OpenURL
Kjos-Hanssen, Bjørn On the complexity of automatic complexity. (English) Zbl 1387.68158 Theory Comput. Syst. 61, No. 4, 1427-1439 (2017). MSC: 68Q45 68Q17 68Q25 PDF BibTeX XML Cite \textit{B. Kjos-Hanssen}, Theory Comput. Syst. 61, No. 4, 1427--1439 (2017; Zbl 1387.68158) Full Text: DOI arXiv OpenURL
Dębski, Michal; Grytczuk, Jarosław; Pastwa, Urszula; Pilat, Barbara; Sokół, Joanna; Tuczyński, Michał; Wenus, Przemysław; Węsek, Krzysztof On avoding \(r\)-repetitions in \(\mathbb R^2\). (English) Zbl 1378.05055 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 331-337 (2017). MSC: 05C15 PDF BibTeX XML Cite \textit{M. Dębski} et al., Electron. Notes Discrete Math. 61, 331--337 (2017; Zbl 1378.05055) Full Text: DOI OpenURL
Defant, Colin Anti-power prefixes of the Thue-Morse word. (English) Zbl 1355.05005 Electron. J. Comb. 24, No. 1, Research Paper P1.32, 17 p. (2017). MSC: 05A05 68R15 PDF BibTeX XML Cite \textit{C. Defant}, Electron. J. Comb. 24, No. 1, Research Paper P1.32, 17 p. (2017; Zbl 1355.05005) Full Text: arXiv Link OpenURL
Kotlyarov, Nikita V. Square-free words with one possible mismatch. (English. Russian original) Zbl 1344.68180 Mosc. Univ. Math. Bull. 71, No. 1, 31-34 (2016); translation from Vestn. Mosk. Univ., Ser. I 71, No. 1, 48-52 (2016). Reviewer: Gabriele Fici (Palermo) MSC: 68R15 PDF BibTeX XML Cite \textit{N. V. Kotlyarov}, Mosc. Univ. Math. Bull. 71, No. 1, 31--34 (2016; Zbl 1344.68180); translation from Vestn. Mosk. Univ., Ser. I 71, No. 1, 48--52 (2016) Full Text: DOI OpenURL
Frosini, Andrea; Guerrini, Veronica; Rinaldi, Simone Geometric properties of matrices induced by pattern avoidance. (English) Zbl 1339.05051 Theor. Comput. Sci. 624, 109-120 (2016). MSC: 05B50 PDF BibTeX XML Cite \textit{A. Frosini} et al., Theor. Comput. Sci. 624, 109--120 (2016; Zbl 1339.05051) Full Text: DOI OpenURL
Petrova, Elena A. Avoiding letter patterns in ternary square-free words. (English) Zbl 1337.68218 Electron. J. Comb. 23, No. 1, Research Paper P1.18, 12 p. (2016). Reviewer: Anton Cerny (Safat) MSC: 68R15 PDF BibTeX XML Cite \textit{E. A. Petrova}, Electron. J. Comb. 23, No. 1, Research Paper P1.18, 12 p. (2016; Zbl 1337.68218) Full Text: Link OpenURL
Hegedüs, László; Nagy, Benedek On periodic properties of circular words. (English) Zbl 1333.68220 Discrete Math. 339, No. 3, 1189-1197 (2016). MSC: 68R15 PDF BibTeX XML Cite \textit{L. Hegedüs} and \textit{B. Nagy}, Discrete Math. 339, No. 3, 1189--1197 (2016; Zbl 1333.68220) Full Text: DOI OpenURL
de Luca, Aldo; Zamboni, Luca Q. On some variations of coloring problems of infinite words. (English) Zbl 1341.68147 J. Comb. Theory, Ser. A 137, 166-178 (2016). MSC: 68R15 05D10 PDF BibTeX XML Cite \textit{A. de Luca} and \textit{L. Q. Zamboni}, J. Comb. Theory, Ser. A 137, 166--178 (2016; Zbl 1341.68147) Full Text: DOI arXiv OpenURL
Polyakov, N. L. On the algorithmic decidability of the square-free word problem relative to a system of two defining relations. (English. Russian original) Zbl 1343.68189 J. Math. Sci., New York 204, No. 6, 800-807 (2015); translation from Sovrem. Mat. Prilozh. 88 (2013). MSC: 68R15 03D40 20M05 PDF BibTeX XML Cite \textit{N. L. Polyakov}, J. Math. Sci., New York 204, No. 6, 800--807 (2015; Zbl 1343.68189); translation from Sovrem. Mat. Prilozh. 88 (2013) Full Text: DOI arXiv OpenURL
Rao, Michaël; Rigo, Michel; Salimov, Pavel Avoiding 2-binomial squares and cubes. (English) Zbl 1325.68173 Theor. Comput. Sci. 572, 83-91 (2015). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 68R15 PDF BibTeX XML Cite \textit{M. Rao} et al., Theor. Comput. Sci. 572, 83--91 (2015; Zbl 1325.68173) Full Text: DOI arXiv OpenURL
Kuzmics, Christoph; Palfrey, Thomas; Rogers, Brian W. Symmetric play in repeated allocation games. (English) Zbl 1309.91018 J. Econ. Theory 154, 25-67 (2014). MSC: 91A20 91A26 PDF BibTeX XML Cite \textit{C. Kuzmics} et al., J. Econ. Theory 154, 25--67 (2014; Zbl 1309.91018) Full Text: DOI Link OpenURL
Ochem, Pascal; Pinlou, Alexandre Application of entropy compression in pattern avoidance. (English) Zbl 1299.68046 Electron. J. Comb. 21, No. 2, Research Paper P2.7, 12 p. (2014). MSC: 68R15 PDF BibTeX XML Cite \textit{P. Ochem} and \textit{A. Pinlou}, Electron. J. Comb. 21, No. 2, Research Paper P2.7, 12 p. (2014; Zbl 1299.68046) Full Text: arXiv Link OpenURL
Huova, M.; Karhumäki, J. On \(k\)-abelian avoidability. (English) Zbl 1277.68224 J. Math. Sci., New York 192, No. 3, 352-358 (2013) and Zap. Nauchn. Semin. POMI 402, 170-182 (2012). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{M. Huova} and \textit{J. Karhumäki}, J. Math. Sci., New York 192, No. 3, 352--358 (2013; Zbl 1277.68224) Full Text: DOI OpenURL
Shur, Arseny M. Growth properties of power-free languages. (English) Zbl 1298.68157 Comput. Sci. Rev. 6, No. 5-6, 187-208 (2012). MSC: 68Q45 68-02 PDF BibTeX XML Cite \textit{A. M. Shur}, Comput. Sci. Rev. 6, No. 5--6, 187--208 (2012; Zbl 1298.68157) Full Text: DOI OpenURL
Bannai, Hideo; Gagie, Travis; I, Tomohiro; Inenaga, Shunsuke; Landau, Gad M.; Lewenstein, Moshe An efficient algorithm to test square-freeness of strings compressed by straight-line programs. (English) Zbl 1248.68575 Inf. Process. Lett. 112, No. 19, 711-714 (2012). MSC: 68W32 68P30 PDF BibTeX XML Cite \textit{H. Bannai} et al., Inf. Process. Lett. 112, No. 19, 711--714 (2012; Zbl 1248.68575) Full Text: DOI OpenURL
Huova, Mari; Karhumäki, Juhani; Saarela, Aleksi Problems in between words and abelian words: \(k\)-abelian avoidability. (English) Zbl 1280.68149 Theor. Comput. Sci. 454, 172-177 (2012). Reviewer: Anton Cerny (Safat) MSC: 68R15 PDF BibTeX XML Cite \textit{M. Huova} et al., Theor. Comput. Sci. 454, 172--177 (2012; Zbl 1280.68149) Full Text: DOI OpenURL
Shur, Arseny M. Deciding context equivalence of binary overlap-free words in linear time. (English) Zbl 1279.68241 Semigroup Forum 84, No. 3, 447-471 (2012). MSC: 68Q70 68R15 PDF BibTeX XML Cite \textit{A. M. Shur}, Semigroup Forum 84, No. 3, 447--471 (2012; Zbl 1279.68241) Full Text: DOI OpenURL
Blanchet-Sadri, F.; Mercaş, Robert; Rashin, Abraham; Willett, Elara Periodicity algorithms and a conjecture on overlaps in partial words. (English) Zbl 1250.68216 Theor. Comput. Sci. 443, 35-45 (2012). Reviewer: Turek Ondřej (Kochi) MSC: 68R15 68W05 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 443, 35--45 (2012; Zbl 1250.68216) Full Text: DOI OpenURL
Harju, Tero Square-free words obtained from prefixes by permutations. (English) Zbl 1243.68232 Theor. Comput. Sci. 429, 128-133 (2012). MSC: 68R15 PDF BibTeX XML Cite \textit{T. Harju}, Theor. Comput. Sci. 429, 128--133 (2012; Zbl 1243.68232) Full Text: DOI OpenURL
Blanchet-Sadri, F.; Kim, Jane I.; Mercaş, Robert; Severa, William; Simmons, Sean; Xu, Dimin Avoiding Abelian squares in partial words. (English) Zbl 1233.68183 J. Comb. Theory, Ser. A 119, No. 1, 257-270 (2012). MSC: 68R15 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., J. Comb. Theory, Ser. A 119, No. 1, 257--270 (2012; Zbl 1233.68183) Full Text: DOI OpenURL
Blanchet-Sadri, F.; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric Avoidable binary patterns in partial words. (English) Zbl 1243.68230 Acta Inf. 48, No. 1, 25-41 (2011). Reviewer: Panayiotis Vlamos (Athens) MSC: 68R15 11B85 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Acta Inf. 48, No. 1, 25--41 (2011; Zbl 1243.68230) Full Text: DOI OpenURL
Kolpakov, Roman; Rao, Michaël On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. (English) Zbl 1231.68189 Theor. Comput. Sci. 412, No. 46, 6507-6516 (2011). MSC: 68R15 PDF BibTeX XML Cite \textit{R. Kolpakov} and \textit{M. Rao}, Theor. Comput. Sci. 412, No. 46, 6507--6516 (2011; Zbl 1231.68189) 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
Harju, Tero; Kärki, Tomi On the number of frames in binary words. (English) Zbl 1225.68141 Theor. Comput. Sci. 412, No. 39, 5276-5284 (2011). MSC: 68R15 PDF BibTeX XML Cite \textit{T. Harju} and \textit{T. Kärki}, Theor. Comput. Sci. 412, No. 39, 5276--5284 (2011; Zbl 1225.68141) Full Text: DOI OpenURL
Blanchet-Sadri, F.; Choi, Ilkyoo; Mercaş, Robert Avoiding large squares in partial words. (English) Zbl 1221.68176 Theor. Comput. Sci. 412, No. 29, 3752-3758 (2011). MSC: 68R15 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 412, No. 29, 3752--3758 (2011; Zbl 1221.68176) Full Text: DOI OpenURL
Widmer, Steven Permutation complexity of the Thue-Morse word. (English) Zbl 1234.05012 Adv. Appl. Math. 47, No. 2, 309-329 (2011). MSC: 05A05 68R15 PDF BibTeX XML Cite \textit{S. Widmer}, Adv. Appl. Math. 47, No. 2, 309--329 (2011; Zbl 1234.05012) Full Text: DOI arXiv OpenURL
Rao, Michaël Last cases of Dejean’s conjecture. (English) Zbl 1230.68163 Theor. Comput. Sci. 412, No. 27, 3010-3018 (2011). Reviewer: Jeffrey Shallit (Waterloo) MSC: 68R15 11B85 PDF BibTeX XML Cite \textit{M. Rao}, Theor. Comput. Sci. 412, No. 27, 3010--3018 (2011; Zbl 1230.68163) Full Text: DOI OpenURL
Jamet, D.; Paquin, G.; Richomme, G.; Vuillon, L. On the fixed points of the iterated pseudopalindromic closure operator. (English) Zbl 1220.68077 Theor. Comput. Sci. 412, No. 27, 2974-2987 (2011). MSC: 68R15 PDF BibTeX XML Cite \textit{D. Jamet} et al., Theor. Comput. Sci. 412, No. 27, 2974--2987 (2011; Zbl 1220.68077) Full Text: DOI arXiv HAL OpenURL
Currie, James; Rampersad, Narad A proof of Dejean’s conjecture. (English) Zbl 1215.68192 Math. Comput. 80, No. 274, 1063-1070 (2011). MSC: 68R15 PDF BibTeX XML Cite \textit{J. Currie} and \textit{N. Rampersad}, Math. Comput. 80, No. 274, 1063--1070 (2011; Zbl 1215.68192) Full Text: DOI arXiv OpenURL
Harju, Tero; Nowotka, Dirk Cyclically repetition-free words on small alphabets. (English) Zbl 1234.68330 Inf. Process. Lett. 110, No. 14-15, 591-595 (2010). MSC: 68R15 PDF BibTeX XML Cite \textit{T. Harju} and \textit{D. Nowotka}, Inf. Process. Lett. 110, No. 14--15, 591--595 (2010; Zbl 1234.68330) Full Text: DOI Link OpenURL
Blanchet-Sadri, F.; Clader, E.; Simpson, O. Border correlations of partial words. (English) Zbl 1205.68273 Theory Comput. Syst. 47, No. 1, 179-195 (2010). MSC: 68R15 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Theory Comput. Syst. 47, No. 1, 179--195 (2010; Zbl 1205.68273) Full Text: DOI Link OpenURL
Halava, Vesa; Harju, Tero; Kärki, Tomi On the number of squares in partial words. (English) Zbl 1184.68372 RAIRO, Theor. Inform. Appl. 44, No. 1, 125-138 (2010). MSC: 68R15 PDF BibTeX XML Cite \textit{V. Halava} et al., RAIRO, Theor. Inform. Appl. 44, No. 1, 125--138 (2010; Zbl 1184.68372) Full Text: DOI EuDML Link OpenURL
Currie, James; Rampersad, Narad There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\). (English) Zbl 1211.05006 Discrete Appl. Math. 157, No. 11, 2548-2551 (2009). MSC: 05A05 PDF BibTeX XML Cite \textit{J. Currie} and \textit{N. Rampersad}, Discrete Appl. Math. 157, No. 11, 2548--2551 (2009; Zbl 1211.05006) Full Text: DOI arXiv OpenURL
Currie, James; Rampersad, Narad Dejean’s conjecture holds for \({n\geq 27}\). (English) Zbl 1192.68497 Theor. Inform. Appl. 43, No. 4, 775-778 (2009). MSC: 68R15 PDF BibTeX XML Cite \textit{J. Currie} and \textit{N. Rampersad}, Theor. Inform. Appl. 43, No. 4, 775--778 (2009; Zbl 1192.68497) Full Text: DOI arXiv EuDML OpenURL
Guay-Paquet, Mathieu; Shallit, Jeffrey Avoiding squares and overlaps over the natural numbers. (English) Zbl 1215.68193 Discrete Math. 309, No. 21, 6245-6254 (2009). MSC: 68R15 05A05 PDF BibTeX XML Cite \textit{M. Guay-Paquet} and \textit{J. Shallit}, Discrete Math. 309, No. 21, 6245--6254 (2009; Zbl 1215.68193) Full Text: DOI arXiv OpenURL
Jungers, Raphaël M.; Protasov, Vladimir Y.; Blondel, Vincent D. Overlap-free words and spectra of matrices. (English) Zbl 1171.68035 Theor. Comput. Sci. 410, No. 38-40, 3670-3684 (2009). MSC: 68R15 PDF BibTeX XML Cite \textit{R. M. Jungers} et al., Theor. Comput. Sci. 410, No. 38--40, 3670--3684 (2009; Zbl 1171.68035) Full Text: DOI Link OpenURL
Currie, James; Rampersad, Narad Dejean’s conjecture holds for \(n\geq 30\). (English) Zbl 1173.68050 Theor. Comput. Sci. 410, No. 30-32, 2885-2888 (2009). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{J. Currie} and \textit{N. Rampersad}, Theor. Comput. Sci. 410, No. 30--32, 2885--2888 (2009; Zbl 1173.68050) Full Text: DOI arXiv OpenURL
Blondel, Vincent D.; Cassaigne, Julien; Jungers, Raphaël M. On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\). (English) Zbl 1173.68046 Theor. Comput. Sci. 410, No. 30-32, 2823-2833 (2009). MSC: 68R15 PDF BibTeX XML Cite \textit{V. D. Blondel} et al., Theor. Comput. Sci. 410, No. 30--32, 2823--2833 (2009; Zbl 1173.68046) Full Text: DOI OpenURL
Allouche, Jean-Paul; Rampersad, Narad; Shallit, Jeffrey Periodicity, repetitions, and orbits of an automatic sequence. (English) Zbl 1173.68044 Theor. Comput. Sci. 410, No. 30-32, 2795-2803 (2009). MSC: 68R15 11A55 11B85 11U05 PDF BibTeX XML Cite \textit{J.-P. Allouche} et al., Theor. Comput. Sci. 410, No. 30--32, 2795--2803 (2009; Zbl 1173.68044) Full Text: DOI 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
Blanchet-Sadri, Francine; Mercaş, Robert; Rashin, Abraham; Willett, Elara An answer to a conjecture on overlaps in partial words using periodicity algorithms. (English) Zbl 1234.68197 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, 188-199 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 5457, 188--199 (2009; Zbl 1234.68197) Full Text: DOI OpenURL
Halava, Vesa; Harju, Tero; Kärki, Tomi; Séébold, Patrice Overlap-freeness in infinite partial words. (English) Zbl 1165.68058 Theor. Comput. Sci. 410, No. 8-10, 943-948 (2009). MSC: 68R15 PDF BibTeX XML Cite \textit{V. Halava} et al., Theor. Comput. Sci. 410, No. 8--10, 943--948 (2009; Zbl 1165.68058) Full Text: DOI Link OpenURL
Halava, Vesa; Harju, Tero; Kärki, Tomi Square-free partial words. (English) Zbl 1191.68385 Inf. Process. Lett. 108, No. 5, 290-292 (2008). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Halava} et al., Inf. Process. Lett. 108, No. 5, 290--292 (2008; Zbl 1191.68385) Full Text: DOI Link OpenURL
Kurosaki, Tetsuo Direct definition of a ternary infinite square-free sequence. (English) Zbl 1186.68262 Inf. Process. Lett. 106, No. 5, 175-179 (2008). MSC: 68Q45 68R05 PDF BibTeX XML Cite \textit{T. Kurosaki}, Inf. Process. Lett. 106, No. 5, 175--179 (2008; Zbl 1186.68262) Full Text: DOI OpenURL
Grytczuk, Jarosław Thue type problems for graphs, points, and numbers. (English) Zbl 1160.05036 Discrete Math. 308, No. 19, 4419-4429 (2008). MSC: 05C38 15A15 05A15 15A18 PDF BibTeX XML Cite \textit{J. Grytczuk}, Discrete Math. 308, No. 19, 4419--4429 (2008; Zbl 1160.05036) Full Text: DOI OpenURL
Adamczewski, B.; Rampersad, N. On patterns occurring in binary algebraic numbers. (English) Zbl 1151.11036 Proc. Am. Math. Soc. 136, No. 9, 3105-3109 (2008). Reviewer: Artūras Dubickas (Vilnius) MSC: 11J81 68R15 PDF BibTeX XML Cite \textit{B. Adamczewski} and \textit{N. Rampersad}, Proc. Am. Math. Soc. 136, No. 9, 3105--3109 (2008; Zbl 1151.11036) Full Text: DOI OpenURL
Alon, Noga; Grytczuk, Jarosław Breaking the rhythm on graphs. (English) Zbl 1135.05018 Discrete Math. 308, No. 8, 1375-1380 (2008). MSC: 05C15 05C38 05C80 PDF BibTeX XML Cite \textit{N. Alon} and \textit{J. Grytczuk}, Discrete Math. 308, No. 8, 1375--1380 (2008; Zbl 1135.05018) Full Text: DOI OpenURL
Drmota, M.; Stoll, Th. Newman’s phenomenon for generalized Thue-Morse sequences. (English) Zbl 1175.11012 Discrete Math. 308, No. 7, 1191-1208 (2008). MSC: 11B85 11A63 68R15 PDF BibTeX XML Cite \textit{M. Drmota} and \textit{Th. Stoll}, Discrete Math. 308, No. 7, 1191--1208 (2008; Zbl 1175.11012) Full Text: DOI OpenURL
Rampersad, Narad On the context-freeness of the set of words containing overlaps. (English) Zbl 1184.68330 Inf. Process. Lett. 102, No. 2-3, 74-78 (2007). MSC: 68Q45 PDF BibTeX XML Cite \textit{N. Rampersad}, Inf. Process. Lett. 102, No. 2--3, 74--78 (2007; Zbl 1184.68330) Full Text: DOI arXiv OpenURL
Grytczuk, Jarosław Nonrepetitive colorings of graphs – a survey. (English) Zbl 1139.05020 Int. J. Math. Math. Sci. 2007, Article ID 74639, 10 p. (2007). MSC: 05C15 PDF BibTeX XML Cite \textit{J. Grytczuk}, Int. J. Math. Math. Sci. 2007, Article ID 74639, 10 p. (2007; Zbl 1139.05020) Full Text: DOI EuDML 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
Manea, Florin; Mercaş, Robert Freeness of partial words. (English) Zbl 1154.68457 Theor. Comput. Sci. 389, No. 1-2, 265-277 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{F. Manea} and \textit{R. Mercaş}, Theor. Comput. Sci. 389, No. 1--2, 265--277 (2007; Zbl 1154.68457) Full Text: DOI OpenURL
Carpi, Arturo On Dejean’s conjecture over large alphabets. (English) Zbl 1124.68087 Theor. Comput. Sci. 385, No. 1-3, 137-151 (2007). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{A. Carpi}, Theor. Comput. Sci. 385, No. 1--3, 137--151 (2007; Zbl 1124.68087) Full Text: DOI OpenURL
Richomme, G.; Wlazinski, F. Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms. (English) Zbl 1129.68053 Discrete Appl. Math. 155, No. 15, 2001-2016 (2007). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{G. Richomme} and \textit{F. Wlazinski}, Discrete Appl. Math. 155, No. 15, 2001--2016 (2007; Zbl 1129.68053) Full Text: DOI OpenURL
Bell, Jason P.; Goh, Teow Lim Exponential lower bounds for the number of words of uniform length avoiding a pattern. (English) Zbl 1127.68073 Inf. Comput. 205, No. 9, 1295-1306 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{J. P. Bell} and \textit{T. L. Goh}, Inf. Comput. 205, No. 9, 1295--1306 (2007; Zbl 1127.68073) Full Text: DOI OpenURL
Krieger, Dalia; Shallit, Jeffrey Every real number greater than 1 is a critical exponent. (English) Zbl 1188.68216 Theor. Comput. Sci. 381, No. 1-3, 177-182 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{D. Krieger} and \textit{J. Shallit}, Theor. Comput. Sci. 381, No. 1--3, 177--182 (2007; Zbl 1188.68216) Full Text: DOI OpenURL
Ochem, Pascal Letter frequency in infinite repetition-free words. (English) Zbl 1115.68124 Theor. Comput. Sci. 380, No. 3, 388-392 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{P. Ochem}, Theor. Comput. Sci. 380, No. 3, 388--392 (2007; Zbl 1115.68124) Full Text: DOI OpenURL
Czerwiński, Sebastian; Grytczuk, Jarek Nonrepetitive colorings of graphs. (English) Zbl 1291.05058 Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 453-459 (2007). MSC: 05C15 05C38 PDF BibTeX XML Cite \textit{S. Czerwiński} and \textit{J. Grytczuk}, Electron. Notes Discrete Math. 28, 453--459 (2007; Zbl 1291.05058) Full Text: DOI Link OpenURL
Krieger, Dalia On critical exponents in fixed points of non-erasing morphisms. (English) Zbl 1111.68058 Theor. Comput. Sci. 376, No. 1-2, 70-88 (2007). MSC: 68Q45 68Q70 PDF BibTeX XML Cite \textit{D. Krieger}, Theor. Comput. Sci. 376, No. 1--2, 70--88 (2007; Zbl 1111.68058) Full Text: DOI OpenURL
Berstel, Jean; Perrin, Dominique The origins of combinatorics on words. (English) Zbl 1111.68092 Eur. J. Comb. 28, No. 3, 996-1022 (2007). MSC: 68R15 68-03 01A50 01A60 PDF BibTeX XML Cite \textit{J. Berstel} and \textit{D. Perrin}, Eur. J. Comb. 28, No. 3, 996--1022 (2007; Zbl 1111.68092) Full Text: DOI Link OpenURL
Mohammad-Noori, M.; Currie, James D. Dejean’s conjecture and Sturmian words. (English) Zbl 1111.68096 Eur. J. Comb. 28, No. 3, 876-890 (2007). MSC: 68R15 PDF BibTeX XML Cite \textit{M. Mohammad-Noori} and \textit{J. D. Currie}, Eur. J. Comb. 28, No. 3, 876--890 (2007; Zbl 1111.68096) Full Text: DOI 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
Brešar, B.; Grytczuk, J.; Klavžar, S.; Niwczyk, S.; Peterin, I. Nonrepetitive colorings of trees. (English) Zbl 1106.68089 Discrete Math. 307, No. 2, 163-172 (2007). MSC: 68R15 11B83 05C05 05C15 PDF BibTeX XML Cite \textit{B. Brešar} et al., Discrete Math. 307, No. 2, 163--172 (2007; Zbl 1106.68089) Full Text: DOI OpenURL
Komornik, Vilmos; Loreti, Paola On the topological structure of univoque sets. (English) Zbl 1111.11005 J. Number Theory 122, No. 1, 157-183 (2007). Reviewer: Jean-Paul Allouche (Orsay) MSC: 11A63 11B83 68R15 PDF BibTeX XML Cite \textit{V. Komornik} and \textit{P. Loreti}, J. Number Theory 122, No. 1, 157--183 (2007; Zbl 1111.11005) Full Text: DOI OpenURL
Brown, Shandy; Rampersad, Narad; Shallit, Jeffrey; Vasiga, Troy Squares and overlaps in the Thue-Morse sequence and some variants. (English) Zbl 1110.68117 Theor. Inform. Appl. 40, No. 3, 473-484 (2006). MSC: 68R15 PDF BibTeX XML Cite \textit{S. Brown} et al., Theor. Inform. Appl. 40, No. 3, 473--484 (2006; Zbl 1110.68117) Full Text: DOI Numdam EuDML Link OpenURL
Ochem, Pascal A generator of morphisms for infinite words. (English) Zbl 1110.68122 Theor. Inform. Appl. 40, No. 3, 427-441 (2006). MSC: 68R15 PDF BibTeX XML Cite \textit{P. Ochem}, Theor. Inform. Appl. 40, No. 3, 427--441 (2006; Zbl 1110.68122) Full Text: DOI Numdam Numdam EuDML OpenURL
Brlek, S.; Dulucq, S.; Ladouceur, A.; Vuillon, L. Combinatorial properties of smooth infinite words. (English) Zbl 1116.11014 Theor. Comput. Sci. 352, No. 1-3, 306-317 (2006). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 11B85 68Q45 68R15 PDF BibTeX XML Cite \textit{S. Brlek} et al., Theor. Comput. Sci. 352, No. 1--3, 306--317 (2006; Zbl 1116.11014) Full Text: DOI Link OpenURL
Reidenbach, Daniel A non-learnable class of E-pattern languages. (English) Zbl 1086.68116 Theor. Comput. Sci. 350, No. 1, 91-102 (2006). MSC: 68T10 68Q32 68T05 PDF BibTeX XML Cite \textit{D. Reidenbach}, Theor. Comput. Sci. 350, No. 1, 91--102 (2006; Zbl 1086.68116) Full Text: DOI Link OpenURL
Ilie, Lucian; Ochem, Pascal; Shallit, Jeffrey A generalization of repetition threshold. (English) Zbl 1079.68082 Theor. Comput. Sci. 345, No. 2-3, 359-369 (2005). MSC: 68R15 PDF BibTeX XML Cite \textit{L. Ilie} et al., Theor. Comput. Sci. 345, No. 2--3, 359--369 (2005; Zbl 1079.68082) Full Text: DOI arXiv OpenURL
Apostolico, Alberto; Brimkov, Valentin E. Optimal discovery of repetitions in 2D. (English) Zbl 1101.68501 Discrete Appl. Math. 151, No. 1-3, 5-20 (2005). MSC: 68P10 68T10 68W40 PDF BibTeX XML Cite \textit{A. Apostolico} and \textit{V. E. Brimkov}, Discrete Appl. Math. 151, No. 1--3, 5--20 (2005; Zbl 1101.68501) Full Text: DOI OpenURL
Papers presented at the conference ‘XXIIIrd Journées Arithmétiques’, Graz, Austria, July 6–12, 2003. (English) Zbl 1071.11003 J. Théor. Nombres Bordx. 17, No. 1, 435 p. (2005). MSC: 11-06 00B25 PDF BibTeX XML Cite J. Théor. Nombres Bordx. 17, No. 1, 435 p. (2005; Zbl 1071.11003) Full Text: DOI OpenURL
Currie, James D. Pattern avoidance: themes and variations. (English) Zbl 1076.68051 Theor. Comput. Sci. 339, No. 1, 7-18 (2005). Reviewer: Mikhail Volkov (Ekaterinburg) MSC: 68R15 05A05 PDF BibTeX XML Cite \textit{J. D. Currie}, Theor. Comput. Sci. 339, No. 1, 7--18 (2005; Zbl 1076.68051) Full Text: DOI OpenURL
Leupold, Peter; Martín-Vide, Carlos; Mitrana, Victor Uniformly bounded duplication languages. (English) Zbl 1077.68047 Discrete Appl. Math. 146, No. 3, 301-310 (2005). MSC: 68Q45 PDF BibTeX XML Cite \textit{P. Leupold} et al., Discrete Appl. Math. 146, No. 3, 301--310 (2005; Zbl 1077.68047) Full Text: DOI OpenURL
Castiglione, G.; Restivo, A.; Salemi, S. Patterns in words and languages. (English) Zbl 1088.68145 Discrete Appl. Math. 144, No. 3, 237-246 (2004). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{G. Castiglione} et al., Discrete Appl. Math. 144, No. 3, 237--246 (2004; Zbl 1088.68145) Full Text: DOI OpenURL
Harju, Tero; Nowotka, Dirk Border correlation of binary words. (English) Zbl 1094.68072 J. Comb. Theory, Ser. A 108, No. 2, 331-341 (2004). MSC: 68R15 PDF BibTeX XML Cite \textit{T. Harju} and \textit{D. Nowotka}, J. Comb. Theory, Ser. A 108, No. 2, 331--341 (2004; Zbl 1094.68072) Full Text: DOI OpenURL
Richomme, G.; Wlazinski, F. Overlap-free morphisms and finite test-sets. (English) Zbl 1073.68069 Discrete Appl. Math. 143, No. 1-3, 92-109 (2004). MSC: 68R15 PDF BibTeX XML Cite \textit{G. Richomme} and \textit{F. Wlazinski}, Discrete Appl. Math. 143, No. 1--3, 92--109 (2004; Zbl 1073.68069) Full Text: DOI OpenURL