Geodesic
About invertibility finite automata with finite delay
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 35-36 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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
Mots-clés : proportion of invertible automata. 
@article{PDMA_2013_6_a17,
     author = {D. A. Katerinskiy},
     title = {About invertibility finite automata with finite delay},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {35--36},
     year = {2013},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a17/}
}
TY  - JOUR
AU  - D. A. Katerinskiy
TI  - About invertibility finite automata with finite delay
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 35
EP  - 36
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a17/
LA  - ru
ID  - PDMA_2013_6_a17
ER  - 
%0 Journal Article
%A D. A. Katerinskiy
%T About invertibility finite automata with finite delay
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 35-36
%N 6
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a17/
%G ru
%F PDMA_2013_6_a17
D. A. Katerinskiy. About invertibility finite automata with finite delay. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 35-36. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a17/

[1] Bogachenko N. F., “Primenenie teoretiko-avtomatnykh modelei v kriptografii”, Matematicheskie struktury i modelirovanie, 2007, no. 17, 112–120

[2] Tao R. J., Finite automata and application to cryptography, Springer, Tsinghua, 2008 | MR