Estimation of state complexity of combined operations

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 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
Title of host publicationDescriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008
PublisherUniversity of Prince Edward Island
Pages168-181
Number of pages14
ISBN (Print)9780919013568
Publication statusPublished - 2008
Event10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008 - Charlottetown, PE, Canada
Duration: Jul 16 2008Jul 18 2008

Other

Other10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008
CountryCanada
CityCharlottetown, PE
Period7/16/087/18/08

Keywords

  • Boolean operations
  • Cate- nation
  • Combined operations
  • Estimation
  • Multiple operations
  • State complexity

ASJC Scopus subject areas

  • Software

Cite this

Ésik, Z., Gao, Y., Liu, G., & Yu, S. (2008). Estimation of state complexity of combined operations. In Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008 (pp. 168-181). University of Prince Edward Island.

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

Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island, 2008. p. 168-181.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ésik, Z, Gao, Y, Liu, G & Yu, S 2008, Estimation of state complexity of combined operations. in Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island, pp. 168-181, 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, PE, Canada, 7/16/08.
Ésik Z, Gao Y, Liu G, Yu S. Estimation of state complexity of combined operations. In Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island. 2008. p. 168-181
Ésik, Z. ; Gao, Yuan ; Liu, Guangwu ; Yu, Sheng. / Estimation of state complexity of combined operations. Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island, 2008. pp. 168-181
@inproceedings{fdf1382616374795a4a78618e0549b62,
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 = "Boolean operations, Cate- nation, Combined operations, Estimation, Multiple operations, State complexity",
author = "Z. {\'E}sik and Yuan Gao and Guangwu Liu and Sheng Yu",
year = "2008",
language = "English",
isbn = "9780919013568",
pages = "168--181",
booktitle = "Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008",
publisher = "University of Prince Edward Island",

}

TY - GEN

T1 - Estimation of state complexity of combined operations

AU - Ésik, Z.

AU - Gao, Yuan

AU - Liu, Guangwu

AU - Yu, Sheng

PY - 2008

Y1 - 2008

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 - Boolean operations

KW - Cate- nation

KW - Combined operations

KW - Estimation

KW - Multiple operations

KW - State complexity

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

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

M3 - Conference contribution

SN - 9780919013568

SP - 168

EP - 181

BT - Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008

PB - University of Prince Edward Island

ER -