Login / Signup

Bounds on the automata size for Presburger arithmetic.

Felix Klaedtke
Published in: ACM Trans. Comput. Log. (2008)
Keyphrases
  • presburger arithmetic
  • quantifier elimination
  • lower bound
  • cellular automata
  • relational databases
  • temporal reasoning
  • regular expressions
  • computational framework
  • algebraic structure