THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
Yo-Sub Han, Derick Wood · International Journal of Foundations of Computer Science · 2005
We explore expression automata with respect to determinism and minimization. We define determinism of expression automata using prefix-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano's definition of deterministic generalized automata. We prove that deterministic expression automata languages are a proper subfamily of the regular languages. We close by defining the minimization of deterministic expression automata.