A characterization of sequential machines by means of their behaviour fragments

  • I. S. Grunsky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kohavi, L. Switching and finite automata theory. Mc Graw Hill, 1970, 522.Google Scholar
  2. 2.
    Grunsky, I.S. Representations of finite automata, Kibernetika (Kiev), 1985, no.2, 17–23 (Russian).Google Scholar
  3. 3.
    Grunsky, I.S. Conditions of minimal automaton uniqueness in a class of a undistinguishability. Problems of Cybernenics, 1981, no. 38, 263–268 (Russian)Google Scholar
  4. 4.
    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).Google Scholar
  5. 5.
    Bogomolov, A.M., Grunsky, I.S., Speransky, D.V. Checking and transformation of discrete automata, "Nukova dumka", Kiev, 1974, 174 (Russian).Google Scholar
  6. 6.
    Grunsky, I.S., Kozlovsky, V.A. Representations structure of definitely diagnosable automata. Automatika i telemechanika, 1981, no. 6, 147–153 (Russian)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • I. S. Grunsky
    • 1
  1. 1.Institute of Applied Mathematics and Mechanics Academy of Sciences ofDonetskUSSR

Personalised recommendations