### 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 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Lecture Notes in Computer Science*,

*3317*, 156-166.

}

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

**The generalization of generalized automata : Expression automata.** / Han, Yo Sub; Wood, Derick.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - The generalization of generalized automata

T2 - Expression automata

AU - Han, Yo Sub

AU - Wood, Derick

PY - 2005/9/1

Y1 - 2005/9/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=23944454840&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23944454840&partnerID=8YFLogxK

M3 - Conference article

VL - 3317

SP - 156

EP - 166

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -