Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Ochem, Pascal
2007.
Letter frequency in infinite repetition-free words.
Theoretical Computer Science,
Vol. 380,
Issue. 3,
p.
388.
Ochem, Pascal
2010.
Binary words avoiding the pattern AABBCABBA.
RAIRO - Theoretical Informatics and Applications,
Vol. 44,
Issue. 1,
p.
151.
Badkobeh, Golnaz
and
Crochemore, Maxime
2011.
Finite-Repetition threshold for infinite ternary words.
Electronic Proceedings in Theoretical Computer Science,
Vol. 63,
Issue. ,
p.
37.
Badkobeh, Golnaz
2011.
Fewest repetitions versus maximal-exponent powers in infinite binary words.
Theoretical Computer Science,
Vol. 412,
Issue. 48,
p.
6625.
Blanchet-Sadri, F.
Choi, Ilkyoo
and
Mercaş, Robert
2011.
Avoiding large squares in partial words.
Theoretical Computer Science,
Vol. 412,
Issue. 29,
p.
3752.
Shur, Arseny M.
2011.
Developments in Language Theory.
Vol. 6795,
Issue. ,
p.
28.
Blanchet-Sadri, Francine
Black, Kevin
and
Zemke, Andrew
2011.
Language and Automata Theory and Applications.
Vol. 6638,
Issue. ,
p.
155.
Shur, Arseny M.
2012.
Growth properties of power-free languages.
Computer Science Review,
Vol. 6,
Issue. 5-6,
p.
187.
Ochem, Pascal
and
Vaslet, Elise
2012.
Repetition thresholds for subdivided graphs and trees.
RAIRO - Theoretical Informatics and Applications,
Vol. 46,
Issue. 1,
p.
123.
Tunev, Igor N.
and
Shur, Arseny M.
2012.
Mathematical Foundations of Computer Science 2012.
Vol. 7464,
Issue. ,
p.
800.
Blanchet-Sadri, Francine
Lohr, Andrew
and
Scott, Shane
2012.
Combinatorial Algorithms.
Vol. 7643,
Issue. ,
p.
206.
Blanchet-Sadri, Francine
and
Woodhouse, Brent
2013.
Developments in Language Theory.
Vol. 7907,
Issue. ,
p.
106.
Blanchet-Sadri, F.
Lohr, Andrew
and
Scott, Shane
2013.
Computing the partial word avoidability indices of ternary patterns.
Journal of Discrete Algorithms,
Vol. 23,
Issue. ,
p.
119.
Blanchet-Sadri, F.
and
Woodhouse, Brent
2013.
Strict bounds for pattern avoidance.
Theoretical Computer Science,
Vol. 506,
Issue. ,
p.
17.
Badkobeh, Golnaz
2013.
Infinite words containing the minimal number of repetitions.
Journal of Discrete Algorithms,
Vol. 20,
Issue. ,
p.
38.
Blanchet-Sadri, Francine
Lohr, Andrew
Simmons, Sean
and
Woodhouse, Brent
2014.
Language and Automata Theory and Applications.
Vol. 8370,
Issue. ,
p.
173.
Badkobeh, Golnaz
and
Crochemore, Maxime
2015.
Infinite binary words containing repetitions of odd period.
Information Processing Letters,
Vol. 115,
Issue. 5,
p.
543.
Badkobeh, Golnaz
and
Ochem, Pascal
2015.
Characterization of some binary words with few squares.
Theoretical Computer Science,
Vol. 588,
Issue. ,
p.
73.
Ochem, Pascal
and
Rosenfeld, Matthieu
2016.
Developments in Language Theory.
Vol. 9840,
Issue. ,
p.
344.
Mercaş, Robert
2017.
On the aperiodic avoidability of binary patterns with variables and reversals.
Theoretical Computer Science,
Vol. 682,
Issue. ,
p.
180.