Characterization of opaque automata Original Research Article

A finite automaton is a machine which transforms any sequence over an alphabet into a sequence over another alphabet. Its opacity measures the distortion between the input and the output. A finite automaton is called opaque if its opacity is maximal. In this article we shall continue our study on the opacity of a finite automaton and characterize opaque automata.