Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Arto K. Salomaa · Fundamenta Informaticae · 2012
We present schemes of deterministic finite automata such that, for every nontrivial automaton A resulting from the scheme with n states, the state complexity of the mirror image of the language L(A) equals 2n . The construction leads to cases, where