Least Periods of Factors of Infinite Words
RAIRO-Theor. Inf. Appl., 43 1 (2009) 165-178
Published online: 2008-03-12
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Abelian combinatorics on words: A survey
Gabriele Fici and Svetlana PuzyninaComputer Science Review 47 100532 (2023)
https://doi.org/10.1016/j.cosrev.2022.100532
Asymptotic Analysis of q-Recursive Sequences
Clemens Heuberger, Daniel Krenn and Gabriel F. LipnikAlgorithmica 84 (9) 2480 (2022)
https://doi.org/10.1007/s00453-022-00950-y
Implementation and Application of Automata
Jeffrey ShallitLecture Notes in Computer Science, Implementation and Application of Automata 12803 14 (2021)
https://doi.org/10.1007/978-3-030-79121-6_2
An Inequality for the Number of Periods in a Word
Daniel Gabric, Narad Rampersad and Jeffrey ShallitInternational Journal of Foundations of Computer Science 32 (05) 597 (2021)
https://doi.org/10.1142/S0129054121410094
Abelian periods of factors of Sturmian words
Jarkko PeltomäkiJournal of Number Theory 214 251 (2020)
https://doi.org/10.1016/j.jnt.2020.04.007
Critical exponents of infinite balanced words
Narad Rampersad, Jeffrey Shallit and Élise VandommeTheoretical Computer Science 777 454 (2019)
https://doi.org/10.1016/j.tcs.2018.10.017
Combinatorics on Words
Mélodie LapointeLecture Notes in Computer Science, Combinatorics on Words 10432 109 (2017)
https://doi.org/10.1007/978-3-319-66396-8_11
Abelian powers and repetitions in Sturmian words
Gabriele Fici, Alessio Langiu, Thierry Lecroq, et al.Theoretical Computer Science 635 16 (2016)
https://doi.org/10.1016/j.tcs.2016.04.039
Collapse: A Fibonacci and Sturmian Game
Dennis D. A. Epple and Jason SiefkenThe American Mathematical Monthly 122 (6) 515 (2015)
https://doi.org/10.4169/amer.math.monthly.122.6.515
Searching for Zimin patterns
Wojciech Rytter and Arseny M. ShurTheoretical Computer Science 571 50 (2015)
https://doi.org/10.1016/j.tcs.2015.01.004
ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
DANIEL GOČ, NARAD RAMPERSAD, MICHEL RIGO and PAVEL SALIMOVInternational Journal of Foundations of Computer Science 25 (08) 1097 (2014)
https://doi.org/10.1142/S0129054114400267
Lyndon words and Fibonacci numbers
Kalle SaariJournal of Combinatorial Theory, Series A 121 34 (2014)
https://doi.org/10.1016/j.jcta.2013.09.002
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
DANIEL GOČ, DANE HENSHALL and JEFFREY SHALLITInternational Journal of Foundations of Computer Science 24 (06) 781 (2013)
https://doi.org/10.1142/S0129054113400182
Computer Science – Theory and Applications
Jeffrey ShallitLecture Notes in Computer Science, Computer Science – Theory and Applications 7913 49 (2013)
https://doi.org/10.1007/978-3-642-38536-0_5
Developments in Language Theory
Narad Rampersad, Michel Rigo and Pavel SalimovLecture Notes in Computer Science, Developments in Language Theory 7907 420 (2013)
https://doi.org/10.1007/978-3-642-38771-5_37
Language and Automata Theory and Applications
Daniel Goč, Hamoon Mousavi and Jeffrey ShallitLecture Notes in Computer Science, Language and Automata Theory and Applications 7810 299 (2013)
https://doi.org/10.1007/978-3-642-37064-9_27
ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
ÉMILIE CHARLIER, NARAD RAMPERSAD and JEFFREY SHALLITInternational Journal of Foundations of Computer Science 23 (05) 1035 (2012)
https://doi.org/10.1142/S0129054112400448
Implementation and Application of Automata
Daniel Goč, Dane Henshall and Jeffrey ShallitLecture Notes in Computer Science, Implementation and Application of Automata 7381 180 (2012)
https://doi.org/10.1007/978-3-642-31606-7_16
Developments in Language Theory
Émilie Charlier, Narad Rampersad and Jeffrey ShallitLecture Notes in Computer Science, Developments in Language Theory 6795 165 (2011)
https://doi.org/10.1007/978-3-642-22321-1_15
On the number of frames in binary words
Tero Harju and Tomi KärkiTheoretical Computer Science 412 (39) 5276 (2011)
https://doi.org/10.1016/j.tcs.2011.05.032
Standard factors of Sturmian words
Gwénaël Richomme, Kalle Saari and Luca Q. ZamboniRAIRO - Theoretical Informatics and Applications 44 (1) 159 (2010)
https://doi.org/10.1051/ita/2010011