Self-verifying finite automaton

In automata theory, a self-verifying finite automaton (SVFA) is a special kind of a nondeterministic finite automaton (NFA) with a symmetric kind of nondeterminism introduced by Hromkovič and Schnitger.^[1] Generally, in self-verifying nondeterminism, each computation path is concluded with any of the three possible answers: yes, no, and I do not know. For each input string, no two paths may give contradictory answers, namely both answers yes and no on the same input are not possible. At least one path must give answer yes or no, and if it is yes then the string is considered accepted. SVFA accept the same class of languages as deterministic finite automata (DFA) and NFA but have different state complexity.

Formal definition[]

An SVFA is represented formally by a 6-tuple, A=(Q, Σ, Δ, q₀, F_a, F_r) such that (Q, Σ, Δ, q₀, F_a) is an NFA, and F_a, F_r are disjoint subsets of Q. For each word w = a₁a₂ … a_n, a computation is a sequence of states r₀,r₁, …, r_n, in Q with the following conditions:

1. r₀ = q₀
2. r_i+1 ∈ Δ(r_i, a_i+1), for i = 0, …, n−1.

If r_n ∈ F_a then the computation is accepting, and if r_n ∈ F_r then the computation is rejecting. There is a requirement that for each w there is at least one accepting computation or at least one rejecting computation but not both.

Results[]

Each DFA is a SVFA, but not vice versa. Jirásková and Pighizzini^[2] proved that for every SVFA of n states, there exists an equivalent DFA of ${\displaystyle g(n)=\Theta (3^{n/3})}$ states. Furthermore, for each positive integer n, there exists an n-state SVFA such that the minimal equivalent DFA has exactly ${\displaystyle g(n)}$ states.

Other results on the state complexity of SVFA were obtained by Jirásková and her colleagues.^[3][4]

References[]