Representing Arithmetic Constraints with Finite Automata: An Overview

This publication has 20 references indexed in Scilit:

• Weak alternating automata are not that weak
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
  Published by Springer Nature ,2001
• On the expressiveness of real and integer arithmetic automata
  Published by Springer Nature ,1998
• 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
• Symbolic verification with periodic sets
  Published by Springer Nature ,1994
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Alternating finite automata on ω-words
  Theoretical Computer Science, 1984
• AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
  Published by Elsevier ,1971
• Weak Second‐Order Arithmetic and Finite Automata
  Mathematical Logic Quarterly, 1960