Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Richomme, Gwénaël
Saari, Kalle
and
Zamboni, Luca Q.
2010.
Standard factors of Sturmian words.
RAIRO - Theoretical Informatics and Applications,
Vol. 44,
Issue. 1,
p.
159.
Harju, Tero
and
Kärki, Tomi
2011.
On the number of frames in binary words.
Theoretical Computer Science,
Vol. 412,
Issue. 39,
p.
5276.
Charlier, Émilie
Rampersad, Narad
and
Shallit, Jeffrey
2011.
Developments in Language Theory.
Vol. 6795,
Issue. ,
p.
165.
Goč, Daniel
Henshall, Dane
and
Shallit, Jeffrey
2012.
Implementation and Application of Automata.
Vol. 7381,
Issue. ,
p.
180.
CHARLIER, ÉMILIE
RAMPERSAD, NARAD
and
SHALLIT, JEFFREY
2012.
ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 05,
p.
1035.
Rampersad, Narad
Rigo, Michel
and
Salimov, Pavel
2013.
Developments in Language Theory.
Vol. 7907,
Issue. ,
p.
420.
Goč, Daniel
Mousavi, Hamoon
and
Shallit, Jeffrey
2013.
Language and Automata Theory and Applications.
Vol. 7810,
Issue. ,
p.
299.
Shallit, Jeffrey
2013.
Computer Science – Theory and Applications.
Vol. 7913,
Issue. ,
p.
49.
GOČ, DANIEL
HENSHALL, DANE
and
SHALLIT, JEFFREY
2013.
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS.
International Journal of Foundations of Computer Science,
Vol. 24,
Issue. 06,
p.
781.
Saari, Kalle
2014.
Lyndon words and Fibonacci numbers.
Journal of Combinatorial Theory, Series A,
Vol. 121,
Issue. ,
p.
34.
GOČ, DANIEL
RAMPERSAD, NARAD
RIGO, MICHEL
and
SALIMOV, PAVEL
2014.
ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING).
International Journal of Foundations of Computer Science,
Vol. 25,
Issue. 08,
p.
1097.
Rytter, Wojciech
and
Shur, Arseny M.
2015.
Searching for Zimin patterns.
Theoretical Computer Science,
Vol. 571,
Issue. ,
p.
50.
Dennis D. A. Epple
and
Jason Siefken
2015.
Collapse: A Fibonacci and Sturmian Game.
The American Mathematical Monthly,
Vol. 122,
Issue. 6,
p.
515.
Fici, Gabriele
Langiu, Alessio
Lecroq, Thierry
Lefebvre, Arnaud
Mignosi, Filippo
Peltomäki, Jarkko
and
Prieur-Gaston, Élise
2016.
Abelian powers and repetitions in Sturmian words.
Theoretical Computer Science,
Vol. 635,
Issue. ,
p.
16.
Lapointe, Mélodie
2017.
Combinatorics on Words.
Vol. 10432,
Issue. ,
p.
109.
Rampersad, Narad
Shallit, Jeffrey
and
Vandomme, Élise
2019.
Critical exponents of infinite balanced words.
Theoretical Computer Science,
Vol. 777,
Issue. ,
p.
454.
Peltomäki, Jarkko
2020.
Abelian periods of factors of Sturmian words.
Journal of Number Theory,
Vol. 214,
Issue. ,
p.
251.
Shallit, Jeffrey
2021.
Implementation and Application of Automata.
Vol. 12803,
Issue. ,
p.
14.
Gabric, Daniel
Rampersad, Narad
and
Shallit, Jeffrey
2021.
An Inequality for the Number of Periods in a Word.
International Journal of Foundations of Computer Science,
Vol. 32,
Issue. 05,
p.
597.
Heuberger, Clemens
Krenn, Daniel
and
Lipnik, Gabriel F.
2022.
Asymptotic Analysis of q-Recursive Sequences.
Algorithmica,
Vol. 84,
Issue. 9,
p.
2480.