Learn More
There exist various well-known characterizations of sets of numbers recognizable by a nite automaton, when they are represented in some integer base p 2. We show how to modify these characterizations, when integer bases p are replaced by linear numeration systems whose characteristic polynomial is the minimal polynomial of a Pisot number. We also prove some(More)
We survey the properties of sets of integers recognizable by automata when they are written in p-ary 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 Cobham-Semenov, the original(More)
AUTOMATE is a package for symbolic computation on nite automata, extended rational expressions and nite semigroups. On the one hand, it enables one to compute the deterministic minimal automaton of the language represented by a rational expression or given by its table. On the other hand, given the transition table of a deterministic automaton, AUTOMATE(More)
A set of words X is called unavoidable on a given alphabet A if every infinite word on A has a factor in X. For k, q ≥ 1, let c(k, q) be the number of conjugacy classes of words of length k on q letters. An unavoidable set of words of length k on q symbols has at least c(k, q) elements. We show that for any k, q ≥ 1 there exists an unavoidable set of words(More)