Restricted walks in regular trees.
Ciobanu, Laura, Radomirović, Saša (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ciobanu, Laura, Radomirović, Saša (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fink, Alex (2006)
Integers
Similarity:
Gao, Weidong, Geroldinger, Alfred (2003)
Integers
Similarity:
Mills, Donald, Mitchell, Patrick (2005)
Integers
Similarity:
Ilya Goldstein (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
The repetition threshold is a measure of the extent to which there need to be consecutive (partial) repetitions of finite words within infinite words over alphabets of various sizes. Dejean's Conjecture, which has been recently proven, provides this threshold for all alphabet sizes. Motivated by a question of Krieger, we deal here with the analogous threshold when the infinite word is restricted to be a D0L word. Our main result is that, asymptotically, this threshold does not exceed...
Reznick, Bruce (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Chee, Yeow Meng (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lewittes, Joseph (2007)
Integers
Similarity:
Griggs, T.S., Rosa, A. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Davis, Donald M. (2008)
Integers
Similarity:
Xia, Xingwu (2007)
Integers
Similarity:
Lagarias, J.C., Sloane, N.J.A. (2004)
Experimental Mathematics
Similarity:
Currie, James D., Simpson, Jamie (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: