Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-08-10
EPTCS 31, 2010, pp. 58-67
Computer Science
Formal Languages and Automata Theory
In Proceedings DCFS 2010, arXiv:1008.1270
Scientific paper
10.4204/EPTCS.31.8
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.
Cui Bo
Gao Yuan
Kari Lila
Yu Sheng
No associations
LandOfFree
State Complexity of Catenation Combined with Star and Reversal does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with State Complexity of Catenation Combined with Star and Reversal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State Complexity of Catenation Combined with Star and Reversal will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-583248