State complexity of combined operations for suffix-free regular languages

Hae Sung Eom, Yo-Sub Han

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We investigate the state complexity of combined operations for suffix-free regular languages. Suffix-free deterministic finite-state automata have a unique structural property that is crucial for obtaining the precise state complexity of basic operations. Based on the same property, we establish the state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation. In the case of star-of-intersection, we only have an upper bound and the lower bound is open.

Original languageEnglish
Pages (from-to)87-93
Number of pages7
JournalTheoretical Computer Science
Volume510
DOIs
Publication statusPublished - 2013 Oct 28

Fingerprint

State Complexity
Suffix
Formal languages
Regular Languages
Stars
Star
Intersection
Star Operation
Finite State Automata
Reversal
Structural Properties
Finite automata
Union
Structural properties
Lower bound
Upper bound

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{0fe4739192884254bc8ee0507d7d294f,
title = "State complexity of combined operations for suffix-free regular languages",
abstract = "We investigate the state complexity of combined operations for suffix-free regular languages. Suffix-free deterministic finite-state automata have a unique structural property that is crucial for obtaining the precise state complexity of basic operations. Based on the same property, we establish the state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation. In the case of star-of-intersection, we only have an upper bound and the lower bound is open.",
author = "Eom, {Hae Sung} and Yo-Sub Han",
year = "2013",
month = "10",
day = "28",
doi = "10.1016/j.tcs.2013.09.014",
language = "English",
volume = "510",
pages = "87--93",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

State complexity of combined operations for suffix-free regular languages. / Eom, Hae Sung; Han, Yo-Sub.

In: Theoretical Computer Science, Vol. 510, 28.10.2013, p. 87-93.

Research output: Contribution to journalArticle

TY - JOUR

T1 - State complexity of combined operations for suffix-free regular languages

AU - Eom, Hae Sung

AU - Han, Yo-Sub

PY - 2013/10/28

Y1 - 2013/10/28

N2 - We investigate the state complexity of combined operations for suffix-free regular languages. Suffix-free deterministic finite-state automata have a unique structural property that is crucial for obtaining the precise state complexity of basic operations. Based on the same property, we establish the state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation. In the case of star-of-intersection, we only have an upper bound and the lower bound is open.

AB - We investigate the state complexity of combined operations for suffix-free regular languages. Suffix-free deterministic finite-state automata have a unique structural property that is crucial for obtaining the precise state complexity of basic operations. Based on the same property, we establish the state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation. In the case of star-of-intersection, we only have an upper bound and the lower bound is open.

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

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

U2 - 10.1016/j.tcs.2013.09.014

DO - 10.1016/j.tcs.2013.09.014

M3 - Article

AN - SCOPUS:84887408418

VL - 510

SP - 87

EP - 93

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -