Finite Automata and Application to Cryptography mainly deals with
the invertibility theory of finite automata and its application to
cryptography. In addition, autonomous finite automata and Latin
arrays, which are relative to the canonical form for one-key
cryptosystems based on finite automata, are also discussed. Finite
automata are regarded as a natural model for ciphers. The Ra Rb
transformation method is introduced to deal with the structure... more...