State complexity of basic language operations combined with reversal
We study the state complexity of combined operations on regular languages. Each of the combined operations is a basic operation combined with reversal. We show that their state complexities are all very different from the compositions of state complexities of individual operations. Crown copyright (C) 2008 Published by Elsevier Inc. All rights reserved.
state complexity combined operations regular languages finite state automata