State complexity of four combined operations composed of union, intersection, star and reversal

  • Authors:

  • Yuan Gao;Sheng Yu

  • Affiliations:

  • Department of Computer Science, The University of Western Ontario, London, Ontario, Canada;Department of Computer Science, The University of Western Ontario, London, Ontario, Canada

  • Venue:
  • DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.