State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal

  • Yuan Gao
  • Sheng Yu
Conference paper

DOI: 10.1007/978-3-642-22600-7_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Gao Y., Yu S. (2011) State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

Abstract

In this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the exact bounds for these combined operations on regular languages and show that, as usually, they are different from the mathematical compositions of the state complexities of their individual participating operations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yuan Gao
    • 1
  • Sheng Yu
    • 1
  1. 1.Department of Computer ScienceThe University of Western OntarioLondonCanada

Personalised recommendations