This is a preview of subscription content, log in via an institution to check access.
References
A. Church, “Applications of recursive arithmetic to the problem of circuit synthesis,” in:Summaries of the Summer Institute for Symbolic Logic, Cornell University, New York (1957), pp. 3–50.
J. R. Buchi, “Weak second-order arithmetic and finite automata,”Z. Math. Logik Grundl. Math.,6, No. 1, 66–92 (1960).
B. A. Trakhtenbrot, “Finite automata and one-place predicate logic,”Sib. Mat. Zh.,3, No. 1, 103–131 (1962).
B. A. Trakhtenbrot and Ya. M. Barzdin’,Finite Automata (Behavior and Synthesis) [in Russian], Nauka, Moscow (1970).
Yu. V. Kapitonova and A. A. Letichevskii,Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).
A. G. Kurosh,General Algebra [in Russian], Nauka, Moscow (1974).
A. N. Chebotarev, “A method of abstract synthesis of automata with finite memory,” in:Methods and Tools of Discrete System Design [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1988), pp. 4–12.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 31–42, May–June, 1993.
Rights and permissions
About this article
Cite this article
Chebotarev, A.N. Approach to functional specification of automaton systems. I. Cybern Syst Anal 29, 330–337 (1993). https://doi.org/10.1007/BF01125538
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01125538