A characterization of balanced episturmian sequences.
Paquin, Geneviève, Vuillon, Laurent (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Connections between binary patterns and paperfolding”
A characterization of balanced episturmian sequences.
A classification of periodic turtle sequences.
Holdener, J., Wagaman, A. (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On a problem of Steinhaus concerning binary sequences.
Eliahou, Shalom, Hachez, Delphine (2004)
Experimental Mathematics
Similarity:
Summability of vector sequences
Joseph Deeds (1968)
Studia Mathematica
Similarity:
On a paper by Castelli, Mignosi, Restivo
Jacques Justin (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce from that a characterization of generalized Arnoux-Rauzy sequences or episturmian infinite words.
Pseudorandom sequences of binary vectors
Harald Niederreiter, Joël Rivat, András Sárközy (2008)
Acta Arithmetica
Similarity:
On the correlation of families of pseudorandom sequences of k symbols
Kit-Ho Mak, Alexandru Zaharescu (2016)
Acta Arithmetica
Similarity:
In an earlier paper Gyarmati introduced the notion of f-correlation for families of binary pseudorandom sequences as a measure of randomness in the family. In this paper we generalize the f-correlation to families of pseudorandom sequences of k symbols and study its properties.
Generalized Beatty sequences.
Mercer, A.McD. (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Young tableaux and other mutually describing sequences.
Šuník, Zoran (2002)
Journal of Integer Sequences [electronic only]
Similarity:
On the number of Arnoux-Rauzy words
Filippo Mignosi, Luca Q. Zamboni (2002)
Acta Arithmetica
Similarity:
Sequences of low arithmetical complexity
Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
Arithmetical complexity of a sequence is the number of words of length that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of low arithmetical complexity and describe the family of such words having lowest complexity.