Operations on self-verifying finite automata

Abstract

We investigate the complexity of regular operations on languages represented by self-verifying automata. We get the tight bounds for complement, intersection, union, difference, symmetric difference, reversal, star, left and right quotients, and asymptotically tight bound for concatenation. To prove tightness, we use a binary alphabet in the case of boolean operations and reversal, and an alphabet that grows exponentially for the remaining operations. However, we also provide exponential lower bounds for these operations using a fixed alphabet.