A Generalization of Cobham's Theorem to Automata over Real Numbers

This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in the first-order additive theory of real and integer variables 〈R, Z,+, 1. In this paper, we prove the reciprocal property, i.e., that a subset of R that is recognizable by weak deterministic automata in every base r > 1 is necessarily definable in 〈R, Z,+,<〈. This result generalizes to real numbers the well-known Cobham's theorem on the finite-state recognizability of sets of integers. Our proof gives interesting insight into the internal structure of automata recognizing sets of real numbers, which may lead to efficient data structures for handling these sets.

[1]  A. L. Semenov,et al.  Presburgerness of predicates regular in two number systems , 1977 .

[2]  Jeremy Avigad,et al.  Quantifier elimination for the reals with a predicate for the powers of two , 2006, Theor. Comput. Sci..

[3]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[4]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

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

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

[7]  Pierre Wolper,et al.  Verifying Systems with Infinite but Regular State Spaces , 1998, CAV.

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

[9]  Jérôme Leroux,et al.  A polynomial time Presburger criterion and synthesis for number decision diagrams , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[10]  Lou van den Dries,et al.  The field of reals with a predicate for the powers of two , 1985 .

[11]  Christof Löding,et al.  Efficient minimization of deterministic weak omega-automata , 2001, Inf. Process. Lett..

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

[13]  Bernard Boigelot,et al.  Counting the solutions of Presburger equations without enumerating them , 2001, Theor. Comput. Sci..

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

[15]  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.

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

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

[18]  Roger Villemaire,et al.  The Theory of (N, +, Vk, V1) is Undecidable , 1992, Theor. Comput. Sci..

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

[20]  Orna Kupferman,et al.  Complementation Constructions for Nondeterministic Automata on Infinite Words , 2005, TACAS.