Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICALP
2007
Springer

favoriteEmaildiscussreport

92views Programming Languages» more ICALP 2007»

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

13 years 8 months ago

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

Download www.montefiore.ulg.ac.be

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

Bernard Boigelot, Julien Brusten

Real-time Traffic

Automata Recognizing Sets | Expressive Power | First-order Additive Theory | ICALP 2007 | Programming Languages |

claim paper

Related Content

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

» A Generalization of Semenovs Theorem to Automata over Real Numbers

» The elementary computable functions over the real numbers applying two new techniques

» Direct 3DRotation Estimation from Spherical Images via a Generalized Shift Theorem

» Quantitative Languages

» A ProofProducing Decision Procedure for Real Arithmetic

» Combined Decision Techniques for the Existential Theory of the Reals

» Minimum converging precision of the QRfactorization algorithm for real polynomial GCD

» Verifying Nonlinear Real Formulas Via Sums of Squares

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2007
Where	ICALP
Authors	Bernard Boigelot, Julien Brusten

Comments (0)