Mathematical Methods of Cryptography

About invertibility finite automata with finite delay

D. A. Katerinskiy

Tomsk State University

Abstract: Experimental estimates are obtained for the proportion of invertible, weakly invertible and strong invertible finite automata with finite delay. The estimates show that the proportion of the invertible automata is small (about 3 %) for automata with near numbers of states and output symbols and is large (over 80 %) for automata with the number of output symbols being 4 times more than the number of input symbols and 2 times more than the number of states.

Keywords: finite automata, weakly invertibility, invertibility, analysis of invertibility, synthesis of inverse automata, proportion of invertible automata.

UDC: 519.713