TY - JOUR
T1 - The generalization of generalized automata
T2 - Expression automata
AU - Han, Yo Sub
AU - Wood, Derick
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2005/6
Y1 - 2005/6
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33646414953&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33646414953&partnerID=8YFLogxK
U2 - 10.1142/S0129054105003121
DO - 10.1142/S0129054105003121
M3 - Article
AN - SCOPUS:33646414953
VL - 16
SP - 499
EP - 510
JO - International Journal of Foundations of Computer Science
JF - International Journal of Foundations of Computer Science
SN - 0129-0541
IS - 3
ER -