Preview
Unable to display preview. Download preview PDF.
References
Kohavi, L. Switching and finite automata theory. Mc Graw Hill, 1970, 522.
Grunsky, I.S. Representations of finite automata, Kibernetika (Kiev), 1985, no.2, 17–23 (Russian).
Grunsky, I.S. Conditions of minimal automaton uniqueness in a class of a undistinguishability. Problems of Cybernenics, 1981, no. 38, 263–268 (Russian)
Grunsky, I.S. Checking and diagnostics of automata by means of identifiers of states. Proc. Int. Symp. IFAC "Discrete Systems" Riga, 1974, "Zinatne", Riga, 1974, vol. 2, 82–89 (Russian).
Bogomolov, A.M., Grunsky, I.S., Speransky, D.V. Checking and transformation of discrete automata, "Nukova dumka", Kiev, 1974, 174 (Russian).
Grunsky, I.S., Kozlovsky, V.A. Representations structure of definitely diagnosable automata. Automatika i telemechanika, 1981, no. 6, 147–153 (Russian)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grunsky, I.S. (1987). A characterization of sequential machines by means of their behaviour fragments. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_40
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive