Geodesic
Transitions identification experiments with information-lossless automata
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 29-30 
V. N. Trenkaev. Transitions identification experiments with information-lossless automata. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 29-30. http://geodesic.mathdoc.fr/item/PDM_2009_10_a13/
@article{PDM_2009_10_a13,
     author = {V. N. Trenkaev},
     title = {Transitions identification experiments with information-lossless automata},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {29--30},
     year = {2009},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a13/}
}
TY  - JOUR
AU  - V. N. Trenkaev
TI  - Transitions identification experiments with information-lossless automata
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 29
EP  - 30
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_10_a13/
LA  - ru
ID  - PDM_2009_10_a13
ER  - 
%0 Journal Article
%A V. N. Trenkaev
%T Transitions identification experiments with information-lossless automata
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 29-30
%N 10
%U http://geodesic.mathdoc.fr/item/PDM_2009_10_a13/
%G ru
%F PDM_2009_10_a13

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper addresses the problem of finite-state machine identification. To solve this problem, simple conditional experiments with automata are used. It is supposed that some automaton transitions are known. An heuristic approach is given to determine the unknown transitions.

[1] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, M., 1985, 320 pp. | MR

[2] Babash A. V., Shankin G. N., Kriptografiya, SOLON-R, M., 2002, 512 pp.

[3] Grunskii I. S., Kozlovskii V. A., Sintez i identifikatsiya avtomatov, Naukova dumka, Kiev, 2004, 245 pp.