Advertisement

On the complexity of analyzing experiments for checking local faults of an automaton

  • V. A. Kozlovskiy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Keywords

Mathematical Logic Local Fault Recognition Problem State Diagram System Implementation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kozlovskiy, V.A. On the recognition of an automaton relative to a locally generated class. Dokl.Akad.Nauk. USSR, 253(1981), no 5,1047–1049. (Russian).Google Scholar
  2. 2.
    Garey,M.R.; Johnson,D.S. Computers and intractability. W.H.Free — man, San Francisco, 1979.Google Scholar
  3. 3.
    Gill, A. Introduction to the theory of finite — state machines. McGraw-Hill Book Company, New York, 1962.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • V. A. Kozlovskiy
    • 1
  1. 1.Institute of Applied Mathematics and Mechanics Academy of Sciences ofDonetskUSSR

Personalised recommendations