Geodesic
Identification of a state machine structure with finites fragment of behavior
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 13 (2013) no. 2, pp. 14-20 
S. A. Bogomolov. Identification of a state machine structure with finites fragment of behavior. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 13 (2013) no. 2, pp. 14-20. http://geodesic.mathdoc.fr/item/ISU_2013_13_2_a2/
@article{ISU_2013_13_2_a2,
     author = {S. A. Bogomolov},
     title = {Identification of a~state machine structure with finites fragment of behavior},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {14--20},
     year = {2013},
     volume = {13},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2013_13_2_a2/}
}
TY  - JOUR
AU  - S. A. Bogomolov
TI  - Identification of a state machine structure with finites fragment of behavior
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2013
SP  - 14
EP  - 20
VL  - 13
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ISU_2013_13_2_a2/
LA  - ru
ID  - ISU_2013_13_2_a2
ER  - 
%0 Journal Article
%A S. A. Bogomolov
%T Identification of a state machine structure with finites fragment of behavior
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2013
%P 14-20
%V 13
%N 2
%U http://geodesic.mathdoc.fr/item/ISU_2013_13_2_a2/
%G ru
%F ISU_2013_13_2_a2

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

Identification of a state machine structure with finite fragments of behavior is discussed. The state machine behavior is a set of various finite-sequential (f.-s.) functions realized in a state machine, and under a finite fragment of behavior we mean traces of f.-s. functions and state machines. The concept of an identifying trace for a state machine irredundant over its realization is introduced. The approach is suggested that enables to separate and descript in the set of traces identifying a state machine the finite set of irredundant traces consisting of only essential information for identification of a state machine.

[1] Ljung L., System Identification: Theory for the User, University of Linkoping, Sweden, 1987, 432 pp. | MR

[2] Bogomolov S. A., “On the synthesis of automata from a finite set experiments”, Dokl. Acad. Sci. USSR, 281:1 (1985), 20–22 | MR | Zbl

[3] Bogomolov S. A., “Reconstruction of an automaton from experiments”, Discrete Mathematics and Applications, 1:2 (1991), 117–128 | DOI | MR | Zbl

[4] Gill A., Introduction to the Theory of Finite-state Machines, McGraw-Hill, 1962, 272 pp. | MR | Zbl

[5] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Topics of Automata Theory, Moscow Univ. Press, Moscow, 1978, 216 pp.

[6] Moor E. F., “Speculative experiments with sequential machines”, Automata Studies, eds. E. Shennon, J. McCarthy, Princeton Univ. Press, Princeton, 1956, 129–153