## Canonical systems which produce periodic sets.(English)Zbl 0188.33104

### Keywords:

languages, automata, networks
Full Text:

### References:

 [1] E. Post, Formal reductions of the general combinatorial decision problem,Amer. J. Math. 65 (1943), 197–215. · Zbl 0063.06327 [2] J. R. Büchi, Regular canonical systems,Arch. Math. Logik Grundlagenforsch. 6 (1964), 91–111. · Zbl 0129.26102 [3] M. Kratko, Formal’nye isčislenija Posta i konečnye avtomaty (Russian),Problemy Kibernet. 17 (1966), 41–65. [4] P. C. Rosenbloom,The Elements of Mathematical Logic, Dover, New York, 1950. · Zbl 0041.14804 [5] W. Hosken, Combinatorial systems which produce regular sets,Notices Amer. Math. Soc. 13 (1966), 732. [6] John Myhill, Finite automata and representations of events, WADO Report TR 57–624,Fundamental Concepts in the Theory of Systems (1957), 112–137. [7] I. T. Medvedev, On a class of events representable in a finite automaton, MIT Lincoln Laboratory Group Report, 34–73 (1958). [8] M. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125. · Zbl 0158.25404 [9] N. Chomsky, Three models for the description of language,IRE Trans. Information Theory IT2 (1956), 113–124 · Zbl 0156.25401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.