The generalization of generalized automata: Expression automata

Yo Sub Han; Derick Wood

doi:10.1142/S0129054105003121

The generalization of generalized automata: Expression automata

Yo Sub Han, Derick Wood

Department of Computer Science

Research output: Contribution to journal › Article

17 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	499-510
Number of pages	12
Journal	International Journal of Foundations of Computer Science
Volume	16
Issue number	3
DOIs	https://doi.org/10.1142/S0129054105003121
Publication status	Published - 2005 Jun

All Science Journal Classification (ASJC) codes

Computer Science (miscellaneous)

Access to Document

10.1142/S0129054105003121

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. International Journal of Foundations of Computer Science, 16(3), 499-510. https://doi.org/10.1142/S0129054105003121

@article{a385c7e6d3bd4ffaa62f20de3172743f,

title = "The generalization of generalized automata: Expression automata",

abstract = "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.",

author = "Han, {Yo Sub} and Derick Wood",

year = "2005",

month = jun,

doi = "10.1142/S0129054105003121",

language = "English",

volume = "16",

pages = "499--510",

journal = "International Journal of Foundations of Computer Science",

issn = "0129-0541",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "3",

}

TY - JOUR

T1 - The generalization of generalized automata

T2 - Expression automata

AU - Han, Yo Sub

AU - Wood, Derick

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 -