The generalization of generalized automata

Expression automata

Yo Sub Han, Derick Wood

Research output: Contribution to journalConference article

10 Citations (Scopus)

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 languageEnglish
Pages (from-to)156-166
Number of pages11
JournalLecture Notes in Computer Science
Volume3317
Publication statusPublished - 2005 Sep 1

Fingerprint

Formal languages
Automata
Determinism
Regular Languages
Prefix-free
Prefix
Generalization

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{ab9f06c9030a4f9888ac1be879c886e7,
title = "The generalization of generalized automata: Expression automata",
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.",
author = "Han, {Yo Sub} and Derick Wood",
year = "2005",
month = "9",
day = "1",
language = "English",
volume = "3317",
pages = "156--166",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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

In: Lecture Notes in Computer Science, Vol. 3317, 01.09.2005, p. 156-166.

Research output: Contribution to journalConference 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 -