We show that a sequence satisfying a certain symmetry property is 2-regular in the sense of Allouche and Shallit. We apply this theorem to develop a general approach for studying the ℓ-abelian complexity of 2-automatic sequences. In particular, we prove that the period-doubling word and the Thue–Morse word have 2-abelian complexity sequences that are 2-regular. Along the way, we also prove that the 2-block codings of these two words have 1-abelian complexity sequences that are 2-regular
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
The concept of k-automatic sequences is at the intersection of number theory and formal language the...
AbstractLet the (subword) complexity of a sequence u=(u(n))n=0∞ over a finite set Σ be the function ...
Since the fundamental work of Cobham, the so-called automatic sequences have been extensively studie...
International audienceWe prove that a sequence satisfying a certain symmetry property is 2-regular i...
We prove that a sequence satisfying a certain symmetry property is 2-regular in the sense of Allouch...
Since the fundamental work of Cobham, the so-called automatic sequences have been extensively studie...
We prove that a sequence satisfying a certain symmetry property is 2-regular in the sense of Allouch...
We prove that a sequence satisfying a certain symmetry property is $2$-regular in the sense of Allou...
We show that the 2-abelian complexity of the infinite Thue–Morse word is 2-regular, and other proper...
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequen...
This dissertation is divided into two (distinct but connected) parts that reflect the joint PhD. We ...
This dissertation is divided into two (distinct but connected) parts that reflect the joint PhD. We ...
This thesis dissertation is divided into two (distinct but connected) parts that reflect the joint P...
The binomial coefficient of two words $u$ and $v$ is the number of times $v$ occurs as a subsequence...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
The concept of k-automatic sequences is at the intersection of number theory and formal language the...
AbstractLet the (subword) complexity of a sequence u=(u(n))n=0∞ over a finite set Σ be the function ...
Since the fundamental work of Cobham, the so-called automatic sequences have been extensively studie...
International audienceWe prove that a sequence satisfying a certain symmetry property is 2-regular i...
We prove that a sequence satisfying a certain symmetry property is 2-regular in the sense of Allouch...
Since the fundamental work of Cobham, the so-called automatic sequences have been extensively studie...
We prove that a sequence satisfying a certain symmetry property is 2-regular in the sense of Allouch...
We prove that a sequence satisfying a certain symmetry property is $2$-regular in the sense of Allou...
We show that the 2-abelian complexity of the infinite Thue–Morse word is 2-regular, and other proper...
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequen...
This dissertation is divided into two (distinct but connected) parts that reflect the joint PhD. We ...
This dissertation is divided into two (distinct but connected) parts that reflect the joint PhD. We ...
This thesis dissertation is divided into two (distinct but connected) parts that reflect the joint P...
The binomial coefficient of two words $u$ and $v$ is the number of times $v$ occurs as a subsequence...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
The concept of k-automatic sequences is at the intersection of number theory and formal language the...
AbstractLet the (subword) complexity of a sequence u=(u(n))n=0∞ over a finite set Σ be the function ...
.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG