State complexity of union and intersection of finite languages

Yo Sub Han; Kai Salomaa

doi:10.1142/S0129054108005838

State complexity of union and intersection of finite languages

Yo Sub Han, Kai Salomaa

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

21 Citations (Scopus)

Abstract

We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. First we compute upper bounds using structural properties of minimal deterministic finite-state automata for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on the size of input deterministic finite-state automata. In addition, we prove that the upper bounds are unreachable for any fixed sized alphabet.

Original language	English
Pages (from-to)	581-595
Number of pages	15
Journal	International Journal of Foundations of Computer Science
Volume	19
Issue number	3
DOIs	https://doi.org/10.1142/S0129054108005838
Publication status	Published - 2008 Jun

All Science Journal Classification (ASJC) codes

Computer Science (miscellaneous)

Access to Document

10.1142/S0129054108005838

Fingerprint Dive into the research topics of 'State complexity of union and intersection of finite languages'. Together they form a unique fingerprint.

Cite this

@article{47375ee78f714b79a2a532cbf1fe379d,

title = "State complexity of union and intersection of finite languages",

abstract = "We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. First we compute upper bounds using structural properties of minimal deterministic finite-state automata for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on the size of input deterministic finite-state automata. In addition, we prove that the upper bounds are unreachable for any fixed sized alphabet.",

author = "Han, {Yo Sub} and Kai Salomaa",

year = "2008",

month = jun,

doi = "10.1142/S0129054108005838",

language = "English",

volume = "19",

pages = "581--595",

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

issn = "0129-0541",

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

number = "3",

}

TY - JOUR

T1 - State complexity of union and intersection of finite languages

AU - Han, Yo Sub

AU - Salomaa, Kai

PY - 2008/6

Y1 - 2008/6

N2 - We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. First we compute upper bounds using structural properties of minimal deterministic finite-state automata for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on the size of input deterministic finite-state automata. In addition, we prove that the upper bounds are unreachable for any fixed sized alphabet.

AB - We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. First we compute upper bounds using structural properties of minimal deterministic finite-state automata for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on the size of input deterministic finite-state automata. In addition, we prove that the upper bounds are unreachable for any fixed sized alphabet.

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

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

U2 - 10.1142/S0129054108005838

DO - 10.1142/S0129054108005838

M3 - Article

AN - SCOPUS:44849090524

VL - 19

SP - 581

EP - 595

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 3

ER -