A succinct canonical register automaton model ?
A MyhillNerode congruence for register automata. Suppressing unnecessary equality tests on data values leads to a more compact representation of a data language. Canonical register automata that are more succinct than other proposals and well-suited for automata learning.
myhillnerode register automata data languages canonical model automata theory