Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-06-23
Computer Science
Formal Languages and Automata Theory
20 pages, 7 figures
Scientific paper
In this paper, we show that, due to the structural properties of the resulting automaton obtained from a prior operation, the state complexity of a combined operation may not be equal but close to the mathematical composition of the state complexities of its component operations. In particular, we provide two witness combined operations: reversal combined with catenation and star combined with catenation.
Cui Bo
Gao Yuan
Kari Lila
Yu Sheng
No associations
LandOfFree
State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation 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 Two Combined Operations: Reversal-Catenation and Star-Catenation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-674889