Experiments with automata when the upper bound of the number of their states is unknown

Cybernetics and Systems Analysis

Volumn 35, Issue 4, 1999, Pages 563-571

  Grunskii, I S ^a   Maksimenko, I I ^a  

^a INSTITUTE OF APPLIED MATHEMATICS AND MECHANICS   (Ukraine)

Author keywords

Automaton behavior; Finite automata; Mealy automata; Recognition of automata

Indexed keywords

EID: 33747312642     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF02835853     Document Type: Article

References (10)

1. É. F. Moore, "Speculative experiments with sequential machines,"in: Avtomaty, Izd. Inostr. Literat., Moscow (1956), pp. 179-271.
2. Ya. M. Barzdin', "Decryption of automata,"Probl. Kibern., No. 21, 103-114 (1969).
3. Ya. M. Barzdin', "Decryption of automata when the upper bound of the number of states is absent,"Dokl. AN SSSR, 190, No. 5, 1048-1051 (1970).
4. B. A. Trakhtenbrot and Ya. M. Barzdin', Finite Automata (Behavior and Synthesis) [in Russian], Nauka, Moscow (1970).
5. B. V. Kudryavtsev, S. V. Alyoshin, and A. S. Podkolzin, An Introduction to the Theory of Automata [in Russian], Nauka, Moscow (1985).
6. I. S. Grunskii, V. A. Kozlovskii, and G. G. Ponomarenko, Representations of Finite Automata by Behavior Fragments [in Russian], Naukova Dumka, Kiev (1990).
7. P. Cohn, Universal Algebra [Russian translation], Mir, Moscow (1968).
8. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).
9. A. M. Bogomolov, A. S. Barashko, and I. S. Grunskii, Experiments with Automata [in Russian], Naukova Dumka, Kiev (1973).
10. A. M. Bogomolov, I. S. Grunskii, and D. V. Speranskii, Check and Transformation of Discrete Automata [in Russian], Naukova Dumka, Kiev (1975).