The generalization of generalized automata: Expression automata

Yo Sub Han, Derick Wood

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)499-510
Number of pages12
JournalInternational Journal of Foundations of Computer Science
Volume16
Issue number3
DOIs
Publication statusPublished - 2005 Jun 1

Fingerprint

Formal languages

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

@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 = "6",
day = "1",
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",

}

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

In: International Journal of Foundations of Computer Science, Vol. 16, No. 3, 01.06.2005, p. 499-510.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The generalization of generalized automata

T2 - Expression automata

AU - Han, Yo Sub

AU - Wood, Derick

PY - 2005/6/1

Y1 - 2005/6/1

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 -