On the expressiveness of real and integer arithmetic automata

This publication has 12 references indexed in Scilit:

• A theory of timed automata
  Published by Elsevier ,2002
• An improved reachability analysis method for strongly linear hybrid systems (extended abstract)
  Published by Springer Nature ,1997
• Diophantine equations, Presburger arithmetic and finite automata
  Published by Springer Nature ,1996
• The algorithmic analysis of hybrid systems
  Theoretical Computer Science, 1995
• Symbolic verification with periodic sets
  Published by Springer Nature ,1994
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Presburgerness of predicates regular in two number systems
  Siberian Mathematical Journal, 1977
• On the base-dependence of sets of numbers recognizable by finite automata
  Theory of Computing Systems, 1969
• Weak Second‐Order Arithmetic and Finite Automata
  Mathematical Logic Quarterly, 1960