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

Abstract. 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, +, < can all be recognized by weak deter

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Bernard Boigelot, Julien Brusten
• Keywords: Automata Recognizing Sets, Expressive Power, First-order Additive Theory, ICALP 2007, Programming Languages