Séminaire Lotharingien de Combinatoire, B35b (1995), 19 pp.

Véronique Bruyère

Automata and Numeration Systems

Abstract. This is a short survey on the following problem: given a set X of N, find a simple algorithm accepting X and rejecting N-X. By simple algorithm we mean a finite automaton, a substitution, a logical formula ...

The following version are available: