### Abstract

We explore expression automata with respect to determinism, minimization and primeness. 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 define the minimization of deterministic expression automata. Lastly, we discuss prime prefix-free regular languages. Note that we have omitted almost all proofs in this preliminary version.

Original language | English |
---|---|

Pages (from-to) | 156-166 |

Number of pages | 11 |

Journal | Lecture Notes in Computer Science |

Volume | 3317 |

Publication status | Published - 2005 Sep 1 |

Event | 9th International Conference on Implementation and Application of Automata, CIAA 2004 - Kingston, Canada Duration: 2004 Jul 22 → 2004 Jul 24 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

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

## Cite this

Han, Y. S., & Wood, D. (2005). The generalization of generalized automata: Expression automata.

*Lecture Notes in Computer Science*,*3317*, 156-166.