Results 1  10
of
10
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 64 (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
On the complexity of algebraic numbers I. Expansions in integer bases
, 2005
"... Let b ≥ 2 be an integer. We prove that the badic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms. In particular, irrational automatic numbers are transcendental. O ..."
Abstract

Cited by 32 (20 self)
 Add to MetaCart
Let b ≥ 2 be an integer. We prove that the badic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms. In particular, irrational automatic numbers are transcendental. Our main tool is a new, combinatorial transcendence criterion.
Axel Thue's work on repetitions in words
 Invited Lecture at the 4th Conference on Formal Power Series and Algebraic Combinatorics
, 1992
"... The purpose of this survey is to present, in contemporary terminology, the fundamental contributions of Axel Thue to the study of combinatorial properties of sequences of symbols, insofar as repetitions are concerned. The present state of the art is also sketched. ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
The purpose of this survey is to present, in contemporary terminology, the fundamental contributions of Axel Thue to the study of combinatorial properties of sequences of symbols, insofar as repetitions are concerned. The present state of the art is also sketched.
Diophantine properties of real numbers generated by finite automata
 Compos. Math
"... Abstract. We study some diophantine properties of automatic real numbers and we present a method to derive irrationality measures for such numbers. As a consequence, we prove that the badic expansion of a Liouville number cannot be generated by a finite automaton, a conjecture due to Shallit. 1. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. We study some diophantine properties of automatic real numbers and we present a method to derive irrationality measures for such numbers. As a consequence, we prove that the badic expansion of a Liouville number cannot be generated by a finite automaton, a conjecture due to Shallit. 1.
Number Theory And Formal Languages
 Emerging Applications of Number Theory, IMA Volumes in Mathematics and Applications
, 1999
"... . I survey some of the connections between formal languages and number theory. Topics discussed include applications of representation in base k, representation by sums of Fibonacci numbers, automatic sequences, transcendence in finite characteristic, automatic real numbers, fixed points of homomorp ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. I survey some of the connections between formal languages and number theory. Topics discussed include applications of representation in base k, representation by sums of Fibonacci numbers, automatic sequences, transcendence in finite characteristic, automatic real numbers, fixed points of homomorphisms, automaticity, and kregular sequences. Key words. finite automata, automatic sequences, transcendence, automaticity AMS(MOS) subject classifications. Primary 11B85, Secondary 11A63 11A55 11J81 1. Introduction. In this paper, I survey some interesting connections between number theory and the theory of formal languages. This is a very large and rapidly growing area, and I focus on a few areas that interest me, rather than attempting to be comprehensive. (An earlier survey of this area, written in French, is [1].) I also give a number of open questions. Number theory deals with the properties of integers, and formal language theory deals with the properties of strings. At the interse...
A PROBLEM ABOUT MAHLER FUNCTIONS
"... Let K be a field of characteristic zero and k and l be two multiplicatively independent positive integers. We prove the following result that was conjectured by Loxton and van der Poorten during the Eighties: a power series F(z) ∈ K[[z]] satisfies both a k and a lMahler type functional equation ..."
Abstract
 Add to MetaCart
Let K be a field of characteristic zero and k and l be two multiplicatively independent positive integers. We prove the following result that was conjectured by Loxton and van der Poorten during the Eighties: a power series F(z) ∈ K[[z]] satisfies both a k and a lMahler type functional equation if and only if it is a rational function.
Séminaire Bourbaki Novembre 2006 59ème année, 20062007, n o 967 THE MANY FACES OF THE SUBSPACE THEOREM
, 2009
"... ..."
On the complexity of algebraic numbers I. Expansions in integer bases
"... Boris Adamczewski and Yann Bugeaud Let b ≥ 2 be an integer. We prove that the bary expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms. In particular, irrational automa ..."
Abstract
 Add to MetaCart
Boris Adamczewski and Yann Bugeaud Let b ≥ 2 be an integer. We prove that the bary expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms. In particular, irrational automatic numbers are transcendental. Our main tool is a new, combinatorial transcendence criterion. 1.
SUBSTITUTION DYNAMICAL SYSTEMS, BRATTELI DIAGRAMS AND DIMENSION GROUPS.
, 2008
"... The present paper explores substitution minimal systems and their relation to stationary Bratteli diagrams and stationary dimension groups. The constructions involved are algorithmic and explicit, and render an effective method to compute an invariant of (ordered) ..."
Abstract
 Add to MetaCart
The present paper explores substitution minimal systems and their relation to stationary Bratteli diagrams and stationary dimension groups. The constructions involved are algorithmic and explicit, and render an effective method to compute an invariant of (ordered)