The generalization of generalized automata: Expression automata

Yo Sub Han, Derick Wood

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)499-510
Number of pages12
JournalInternational Journal of Foundations of Computer Science
Issue number3
Publication statusPublished - 2005 Jun

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)


Dive into the research topics of 'The generalization of generalized automata: Expression automata'. Together they form a unique fingerprint.

Cite this