State Complexity of Finite Partial Languages

Partial word finite automata are deterministic finite automata that may have state transitions on a special symbol o which represents an unknown symbol or a hole in the word. Together with a subset of the input alphabet that gives the symbols which may be substituted for the o, a partial word finite automaton (o-DFA) represents a regular language. However, this substitution implies a certain form of limited nondeterminism in the computations when the o-transitions are replaced by ordinary transitions. In this paper we consider the state complexity of partial word finite automata accepting finite languages. We study the state complexity of the NFA to o-DFA conversion for finite languages as well as the state complexity of the o-DFA to DFA conversion for finite languages. Then we consider the operational state complexity with respect to complementation, union, reversal, and concatenation of finite languages. It turns out that the upper and lower bounds for all these operations are exponential. Moreover, we establish a state complexity hierarchy on the number of productive o-transitions that may appear in o-DFAs accepting finite languages. The levels of the hierarchy are separated by quadratic state costs.