Article (Scientific journals)
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Boigelot, Bernard; Brusten, Julien; Bruyère, Véronique
2010In Logical Methods in Computer Science, 6 (1), p. 1-17
Peer Reviewed verified by ORBi
 

Files


Full Text
paper.pdf
Author postprint (278.19 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Automata; Reals numbers; Semenov's theorem; Mixed real-integer arithmetic
Abstract :
[en] This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations in actual applications. In previous work, it has been established that the sets of numbers that are recognizable by weak deterministic automata in two bases that do not share the same set of prime factors are exactly those that are definable in the first order additive theory of real and integer numbers. This result extends Cobham's theorem, which characterizes the sets of integer numbers that are recognizable by finite automata in multiple bases. In this article, we first generalize this result to multiplicatively independent bases, which brings it closer to the original statement of Cobham's theorem. Then, we study the sets of reals recognizable by Muller automata in two bases. We show with a counterexample that, in this setting, Cobham's theorem does not generalize to multiplicatively independent bases. Finally, we prove that the sets of reals that are recognizable by Muller automata in two bases that do not share the same set of prime factors are exactly those definable in the first order additive theory of real and integer numbers. These sets are thus also recognizable by weak deterministic automata. This result leads to a precise characterization of the sets of real numbers that are recognizable in multiple bases, and provides a theoretical justification to the use of weak automata as symbolic representations of sets.
Disciplines :
Computer science
Author, co-author :
Boigelot, Bernard  ;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique
Brusten, Julien ;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique
Bruyère, Véronique;  Université de Mons-Hainaut - UMH > Institut d'Informatique
Language :
English
Title :
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Publication date :
2010
Journal title :
Logical Methods in Computer Science
eISSN :
1860-5974
Publisher :
Springer, Heidelberg, Germany
Volume :
6
Issue :
1
Pages :
1-17
Peer reviewed :
Peer Reviewed verified by ORBi
Funders :
Interuniversity Attraction Poles program MoVES of the Belgian Federal Science Policy Office
Grant 2.4530.02 of the Belgian Fund for Scientific Research (F.R.S.-FNRS)
Available on ORBi :
since 03 November 2010

Statistics


Number of views
129 (29 by ULiège)
Number of downloads
184 (16 by ULiège)

Scopus citations®
 
11
Scopus citations®
without self-citations
11
OpenCitations
 
6

Bibliography


Similar publications



Contact ORBi