This is a preview of subscription content, log in via an institution to check access.
References
S. C. Kleene, Representations of events in nerve nets and finite automata,Automata Studies, pp. 3–42, Annals of Math. Studies, No. 34, Princeton University Press, Princeton, N.J., 1956.
I. T. Medvedev, On a class of events representable in a finite automaton, Supplement to the Russian translation ofAutomata Studies (C. Shannon and J. McCarthy, eds.), published by the Publishing Agency for Foreign Literature, Moscow, 1956; translated by Jacques J. Schorr-Kon for Lincoln Laboratory Report 34–73, June 1958. Also inE. F. Moore,Sequential Machines, Selected Papers, Addison-Wesley, Reading, Mass., 1964.
J. W. Thatcher andJ. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic,Math. Systems Theory 2 (1968), 57–81.
Author information
Authors and Affiliations
Additional information
This research was partially supported by ONR Contract N00014-68-A-0500 and NSF Grant GP-19295.
Rights and permissions
About this article
Cite this article
Costich, O.L. A medvedev characterization of sets recognized by generalized finite automata. Math. Systems Theory 6, 263–267 (1972). https://doi.org/10.1007/BF01706094
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01706094