State Complexity of Catenation Combined with Star and Reversal

Bo Cui
(The University of Western Ontario)
Yuan Gao
(The University of Western Ontario)
Lila Kari
(The University of Western Ontario)
Sheng Yu
(The University of Western Ontario)

This paper is a continuation of our research work on state complexity of combined operations. Motivated by applications, we study the state complexities of two particular combined operations: catenation combined with star and catenation combined with reversal. We show that the state complexities of both of these combined operations are considerably less than the compositions of the state complexities of their individual participating operations.

In Ian McQuillan and Giovanni Pighizzini: Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems (DCFS 2010), Saskatoon, Canada, 8-10th August 2010, Electronic Proceedings in Theoretical Computer Science 31, pp. 58–67.
Published: 7th August 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.31.8 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org