Estimation of state complexity of combined operations

Z. Ésik, Yuan Gao, Guangwu Liu, Sheng Yu

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

It appears that the state complexity of each combined operation has its own special features. Thus, it is important and practical to obtain good estimates for some commonly used general cases. In this paper, we consider the state complexity of combined Boolean operations and give an exact bound for all of them in the case when the alphabet is not fixed. Moreover, we show that for any fixed alphabet, this bound can be reached in infinitely many cases. We also consider the state complexity of multiple catenations. The state complexities are obtained in the cases of the catenations of three and four languages. An estimate for the catenation of an arbitrary number of languages is given, which is very close to the state complexities in the three and four languages cases.

Original languageEnglish
Pages (from-to)3272-3280
Number of pages9
JournalTheoretical Computer Science
Volume410
Issue number35
DOIs
Publication statusPublished - Aug 28 2009

Fingerprint

State Complexity
Boolean Operation
Estimate
Arbitrary
Language

Keywords

  • Combined operations
  • Estimation
  • Multiple operations
  • State complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Estimation of state complexity of combined operations. / Ésik, Z.; Gao, Yuan; Liu, Guangwu; Yu, Sheng.

In: Theoretical Computer Science, Vol. 410, No. 35, 28.08.2009, p. 3272-3280.

Research output: Contribution to journalArticle

Ésik, Z. ; Gao, Yuan ; Liu, Guangwu ; Yu, Sheng. / Estimation of state complexity of combined operations. In: Theoretical Computer Science. 2009 ; Vol. 410, No. 35. pp. 3272-3280.
@article{50ad890df8f34eeca545f85da6c23990,
title = "Estimation of state complexity of combined operations",
abstract = "It appears that the state complexity of each combined operation has its own special features. Thus, it is important and practical to obtain good estimates for some commonly used general cases. In this paper, we consider the state complexity of combined Boolean operations and give an exact bound for all of them in the case when the alphabet is not fixed. Moreover, we show that for any fixed alphabet, this bound can be reached in infinitely many cases. We also consider the state complexity of multiple catenations. The state complexities are obtained in the cases of the catenations of three and four languages. An estimate for the catenation of an arbitrary number of languages is given, which is very close to the state complexities in the three and four languages cases.",
keywords = "Combined operations, Estimation, Multiple operations, State complexity",
author = "Z. {\'E}sik and Yuan Gao and Guangwu Liu and Sheng Yu",
year = "2009",
month = "8",
day = "28",
doi = "10.1016/j.tcs.2009.03.026",
language = "English",
volume = "410",
pages = "3272--3280",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "35",

}

TY - JOUR

T1 - Estimation of state complexity of combined operations

AU - Ésik, Z.

AU - Gao, Yuan

AU - Liu, Guangwu

AU - Yu, Sheng

PY - 2009/8/28

Y1 - 2009/8/28

N2 - It appears that the state complexity of each combined operation has its own special features. Thus, it is important and practical to obtain good estimates for some commonly used general cases. In this paper, we consider the state complexity of combined Boolean operations and give an exact bound for all of them in the case when the alphabet is not fixed. Moreover, we show that for any fixed alphabet, this bound can be reached in infinitely many cases. We also consider the state complexity of multiple catenations. The state complexities are obtained in the cases of the catenations of three and four languages. An estimate for the catenation of an arbitrary number of languages is given, which is very close to the state complexities in the three and four languages cases.

AB - It appears that the state complexity of each combined operation has its own special features. Thus, it is important and practical to obtain good estimates for some commonly used general cases. In this paper, we consider the state complexity of combined Boolean operations and give an exact bound for all of them in the case when the alphabet is not fixed. Moreover, we show that for any fixed alphabet, this bound can be reached in infinitely many cases. We also consider the state complexity of multiple catenations. The state complexities are obtained in the cases of the catenations of three and four languages. An estimate for the catenation of an arbitrary number of languages is given, which is very close to the state complexities in the three and four languages cases.

KW - Combined operations

KW - Estimation

KW - Multiple operations

KW - State complexity

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

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

U2 - 10.1016/j.tcs.2009.03.026

DO - 10.1016/j.tcs.2009.03.026

M3 - Article

AN - SCOPUS:67650444072

VL - 410

SP - 3272

EP - 3280

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 35

ER -