Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)
On the complexity of analyzing experiments for checking local faults of an automaton
KeywordsMathematical 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.
Unable to display preview. Download preview PDF.
- 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.Garey,M.R.; Johnson,D.S. Computers and intractability. W.H.Free — man, San Francisco, 1979.Google Scholar
- 3.Gill, A. Introduction to the theory of finite — state machines. McGraw-Hill Book Company, New York, 1962.Google Scholar
© Springer-Verlag Berlin Heidelberg 1987