Cite this article as:
Bogomolov S. A. Identification of a state machine structure with finites fragment of behavior . Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2013, vol. 13, iss. 2, pp. 14-20. DOI: https://doi.org/10.18500/1816-9791-2013-13-2-2-14-20
Identification of a state machine structure with finites fragment of behavior
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 p.
2. Bogomolov S. A. On the synthesis of automata from
a finite set experiments. Dokl. Acad. Sci. USSR, 1985,
vol. 281, no. 1, pp. 20–22.
3. Bogomolov S. A. Reconstruction of an automaton from
experiments. Discrete Mathematics and Applications,
1991, vol. 1, no 2, pp. 117–128.
4. Gill A. Introduction to the Theory of Finite-state
Machines. McGraw-Hill, 1962. 272 pp.
5. Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S.
Elementy teorii avtomatov [Topics of Automata Theory].
Moscow, Moscow Univ. Press, 1978. 216 pp. (in Russian).
6. Moor E. F. Speculative experiments with sequential
machines. In Automata Studies, eds. C. E. Shennon,
J. McCarthy. Princeton, Princeton Univ. Press, 1956,
pp. 129–153.
