infinite alphabets

What exactly is computed

The language

theory reals                  # or: theory equality
states q0 q1 q2
initial q0
accepting q1
complement q2                 # optional: complement-accepting states (CFPA)
q0 -> q0 : x < y
q0 -> q1 : x = y
q0 -> q2 : x > y
q1 -> q2 : true
q2 -> q2 : true
pos q0 0 0                    # optional: layout in grid units

Configuration sets

The equality theory

The real theory

What is decided exactly

What is only checked up to a bound

Limits of this version