@techreport{veanes2013minimization,
author = {Veanes, Margus},
title = {Minimization of Symbolic Automata},
year = {2013},
month = {April},
abstract = {Symbolic automata theory lifts classical automata theory to rich alphabet theories.  It does so by replacing an explicit alphabet with an alphabet described implicitly by a Boolean algebra.  We study here one of the core problems, minimization, of automata.  We introduce a new minimization algorithm for symbolic automata that takes advantage of state-of-the-art constraint solving techniques for automata analysis that are both expressive and efficient, even for very large and infinite alphabets.},
publisher = {Microsoft Research},
url = {http://approjects.co.za/?big=en-us/research/publication/minimization-of-symbolic-automata/},
number = {MSR-TR-2013-48},
}