Results 1  10
of
16
Logic and precognizable sets of integers
 Bull. Belg. Math. Soc
, 1994
"... We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given ..."
Abstract

Cited by 68 (4 self)
 Add to MetaCart
We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of CobhamSemenov, the original proof being published in Russian. 1
Counting OverlapFree Binary Words
 Springer LNCS 665
, 1993
"... A word on a finite alphabet A is said to be overlapfree if it contains no factor of the form xuxux, where x is a letter and u a (possibly empty) word. In this paper we study the number un of overlapfree binary words of length n, which is known to be bounded by a polynomial in n. First, we describe ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
A word on a finite alphabet A is said to be overlapfree if it contains no factor of the form xuxux, where x is a letter and u a (possibly empty) word. In this paper we study the number un of overlapfree binary words of length n, which is known to be bounded by a polynomial in n. First, we describe a bijection between the set of overlapfree words and a rational language. This yields recurrence relations for un , which allow to compute un in logarithmic time. Then, we prove that the numbers ff = sup f r j n r = O (un) g and fi = inf f r j un = O (n r ) g are distinct, and we give an upper bound for ff and a lower bound for fi. Finally, we compute an asymptotically tight bound to the number of overlapfree words of length less than n. 1 Introduction In general, the problem of evaluating the number un of words of length n in the language U consisting of words on some finite alphabet A with no factors in a certain set F is not easy. If F is finite, it amounts to counting words in...
Transcendence of Formal Power Series With Rational Coefficients
, 1999
"... We give algebraic proofs of transcendence over Q(X) of formal power series with rational coefficients, by using inter alia reduction modulo prime numbers, and the Christol theorem. Applications to generating series of languages and combinatorial objects are given. Keywords: transcendental formal po ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We give algebraic proofs of transcendence over Q(X) of formal power series with rational coefficients, by using inter alia reduction modulo prime numbers, and the Christol theorem. Applications to generating series of languages and combinatorial objects are given. Keywords: transcendental formal power series, binomial series, automatic sequences, pLucas sequences, ChomskySchutzenberger theorem. 1 Introduction Formal power series with integer coefficients often occur as generating series. Suppose that a set E contains exactly a n elements of "size" n for each integer n: the generating series of this set is the formal power series P n0 a n X n (this series belongs to Z[[X]] ae Q[[X]]). Properties of this formal power series reflect properties of its coefficients, and hence properties of the set E. Roughly speaking, algebraicity of the series over Q(X) means that the set has a strong structure. For example, the ChomskySchutzenberger theorem [16] asserts that the generating seri...
Palindrome complexity
 To appear, Theoret. Comput. Sci
, 2002
"... We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points o ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P ” of HofKnillSimon. We also give an upper bound for the palindrome complexity of a sequence in terms of its (block)complexity. 1
Regularity Properties of the Stern Enumeration of the Rationals
"... s(n) + s(n + 1). Stern showed in 1858 that gcd(s(n), s(n + 1)) = 1, and that every positive rational number a s(n) b occurs exactly once in the form s(n+1) for some n ≥ 1. We show that in a strong sense, the average value of these fractions is 3 2. We also show that for d ≥ 2, the pair (s(n), s(n+1 ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
s(n) + s(n + 1). Stern showed in 1858 that gcd(s(n), s(n + 1)) = 1, and that every positive rational number a s(n) b occurs exactly once in the form s(n+1) for some n ≥ 1. We show that in a strong sense, the average value of these fractions is 3 2. We also show that for d ≥ 2, the pair (s(n), s(n+1)) is uniformly distributed among all feasible pairs of congruence classes modulo d. More precise results are presented for d = 2 and 3. 1
Automatic Dirichlet series
, 2000
"... Dirichlet series whose coefficients are generated by finite automata define meromorphic functions on the whole complex plane. As consequences, a new proof of Cobham's theorem on the existence of logarithmic frequencies of symbols in automatic sequences is given, and certain infinite products are exp ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Dirichlet series whose coefficients are generated by finite automata define meromorphic functions on the whole complex plane. As consequences, a new proof of Cobham's theorem on the existence of logarithmic frequencies of symbols in automatic sequences is given, and certain infinite products are explicitly computed.
Summation of series defined by counting blocks of digits
 J. Number Theory
"... We discuss the summation of certain series defined by counting blocks of digits in the Bary expansion of an integer. For example, if s2(n) denotes the sum of the base2 digits of n, we show that ∑ n≥1 s2(n)/(2n(2n + 1)) = (γ + log 4 π)/2. We recover this previous result of Sondow and provide sever ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We discuss the summation of certain series defined by counting blocks of digits in the Bary expansion of an integer. For example, if s2(n) denotes the sum of the base2 digits of n, we show that ∑ n≥1 s2(n)/(2n(2n + 1)) = (γ + log 4 π)/2. We recover this previous result of Sondow and provide several generalizations. MSC: 11A63, 11Y60. 1
Stern Polynomials
"... Stern polynomials B k (t), k R, are introduced in the following way: B 0 (t) = 0, B 1 (t) = 1, B 2n (t) = tBn (t), and B 2n+1 (t) = Bn+1 (t) + Bn (t). ..."
Abstract
 Add to MetaCart
Stern polynomials B k (t), k R, are introduced in the following way: B 0 (t) = 0, B 1 (t) = 1, B 2n (t) = tBn (t), and B 2n+1 (t) = Bn+1 (t) + Bn (t).