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

@inproceedings{Boigelot2009AGO,
  title={A Generalization of Semenov's Theorem to Automata over Real Numbers},
  author={Bernard Boigelot and Julien Brusten and J{\'e}r{\^o}me Leroux},
  booktitle={CADE},
  year={2009}
}
This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are used, in particular, as symbolic data structures for representing sets definable in the first-order theory 〈R, Z, +,≤〉, i.e., the mixed additive arithmetic of integer and real variables. They also lead to a simple decision procedure for this arithmetic. In previous work, it has been established that the sets definable in 〈R, Z… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Presburgerness of predicates regular in two number systems

A. Semenov
Siberian Mathematical Journal 18 • 1977
View 7 Excerpts
Highly Influenced

A polynomial time Presburger criterion and synthesis for number decision diagrams

20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05) • 2005
View 1 Excerpt

Presburger arithmetic: from automata to formulas

L. Latour
PhD thesis, Université de Liège • 2005
View 1 Excerpt

Infinite words

D. Perrin, J. Pin
Volume 141 of Pure and Applied Mathematics. Elsevier • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…