Results 221 to 230 of about 9,410 (233)
Some of the next articles are maybe not open access.
Converting Self-verifying Automata into Deterministic Automata
2009Self-verifying automata are a special variant of finite automata with a symmetric kind of nondeterminism. In this paper, we study the transformation of self-verifying automata into deterministic automata from a descriptional complexity point of view. The main result is the exact cost, in terms of the number of states, of such a simulation.
G. Jiraskova, G. Pighizzini
openaire +2 more sources