Abstract. This paper presents a new proof that if kα is irrational then the sequence {bα+logk nc}n≥1 is not k-regular. Unlike previous proofs, the meth-ods used do not rely on automata or language theoretic concepts. The paper also proves the stronger statement that if kα is irrational then the generating function in k non-commuting variables associated with {bα + logk nc}n≥1 is not algebraic. Fix an integer k ≥ 2. A sequence {a(n)}n≥0 is k-regular if the Z-module gen-erated by the subsequences {a(ken + i)}n≥0 for e ≥ 0 and 0 ≤ i < ke is finitely generated. Regular sequences were introduced by Allouche and Shallit [1] and have several nice characterizations, including the following characterization as rational power series in non-commuti...
AbstractThe technique of determining a generating function for an unambiguous context-free language ...
Niven [3] gave a simple proof that π is irrational. Koksma [2] modified Niven’s proof to show that e...
Since the fundamental work of Cobham, the so-called automatic sequences have been extensively studie...
peer reviewedRegular sequences generalize the extensively studied automatic sequences. Let S be an a...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
AbstractThe automatic sequence is the central concept at the intersection of formal language theory ...
This paper concerns power series of an arithmetic nature that arise in the analysis of divide-and-co...
International audienceThe main result is a characterization of the generating sequences of the lengt...
In this paper we consider a number of natural decision problems involving k-regular sequences. Speci...
AbstractA sequence is said to be k-automatic if the nth term of this sequence is generated by a fini...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...
When is a set A of positive integers, represented as binary numbers, "regular" in the sense that it ...
Inspired by the proof of the irrationality of ξ(2) and ξ(3), Alladi and Robinson used Legendre polyn...
The thesis deals with the irrationality, irrational sequences, linearly independent sums of series a...
AbstractThe technique of determining a generating function for an unambiguous context-free language ...
Niven [3] gave a simple proof that π is irrational. Koksma [2] modified Niven’s proof to show that e...
Since the fundamental work of Cobham, the so-called automatic sequences have been extensively studie...
peer reviewedRegular sequences generalize the extensively studied automatic sequences. Let S be an a...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
AbstractThe automatic sequence is the central concept at the intersection of formal language theory ...
This paper concerns power series of an arithmetic nature that arise in the analysis of divide-and-co...
International audienceThe main result is a characterization of the generating sequences of the lengt...
In this paper we consider a number of natural decision problems involving k-regular sequences. Speci...
AbstractA sequence is said to be k-automatic if the nth term of this sequence is generated by a fini...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...
When is a set A of positive integers, represented as binary numbers, "regular" in the sense that it ...
Inspired by the proof of the irrationality of ξ(2) and ξ(3), Alladi and Robinson used Legendre polyn...
The thesis deals with the irrationality, irrational sequences, linearly independent sums of series a...
AbstractThe technique of determining a generating function for an unambiguous context-free language ...
Niven [3] gave a simple proof that π is irrational. Koksma [2] modified Niven’s proof to show that e...
Since the fundamental work of Cobham, the so-called automatic sequences have been extensively studie...