Generalizations of Generalized Finite State Machines
Yo Sub Han
Department of Computer Science
HKUST

October 31, 2003
11-11:50 AM
Room 3501, HKUST


Abstract
--------
We introduce the notions of expression automata and deterministic
expression automata. We characterize deterministic expression automata
with prefix-freeness. The results can be viewed as a generalization of  
the characterization of generalized automata. Besides, we show that 
deterministic expression automaton languages are a proper 
subset of regular languages. We also show the minimization of
deterministic expression automata.
This is  joint work with D. Wood.