State Complexity of Catenation Combined with Star and Reversal
Formal Languages and Automata Theory
2010-08-11 v1
Abstract
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.
Cite
@article{arxiv.1008.1648,
title = {State Complexity of Catenation Combined with Star and Reversal},
author = {Bo Cui and Yuan Gao and Lila Kari and Sheng Yu},
journal= {arXiv preprint arXiv:1008.1648},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270