Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-06-18
Computer Science
Formal Languages and Automata Theory
16 pages, 4 figures
Scientific paper
In this paper, we study the state complexities of union and intersection
combined with star and reversal, respectively. We obtain the state complexities
of these combined operations on regular languages and show that they are less
than the mathematical composition of the state complexities of their individual
participating operations.
Gao Yuan
Yu Sheng
No associations
LandOfFree
State complexity of union and intersection 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 union and intersection 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 union and intersection combined with star and reversal will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-261201