On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

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.

[1]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[2]  Thomas Wilke,et al.  Locally Threshold Testable Languages of Infinite Words , 1993, STACS.

[3]  Pierre Wolper,et al.  On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) , 1998, ICALP.

[4]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[5]  Bernard Boigelot.  Symbolic Methods for Exploring Infinite State Spaces , 1998 .

[6]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[7]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[8]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[9]  Alan Cobham,et al.  On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.

[10]  Jochen Eisinger,et al.  Don’t care words with an application to the automata-based approach for real addition , 2006, Formal Methods Syst. Des..

[11]  Moshe Y. Vardi.  The Büchi Complementation Saga , 2007, STACS.

[12]  C. Michaux,et al.  LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS , 1994 .

[13]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) , 1995, SAS.

[14]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[15]  Bernard Boigelot,et al.  A Generalization of Cobham's Theorem to Automata over Real Numbers , 2007, ICALP.

[16]  Bernard Boigelot,et al.  An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract) , 1997, CAV.

[17]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[18]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[19]  R. McNaughton.  Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic , 1963, Journal of Symbolic Logic.