Minsky, M.; Papert, S. Unrecognizable sets of numbers. (English) Zbl 0166.00601 J. Assoc. Comput. Mach. 13, 281-286 (1966). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 24 Documents Keywords:languages, automata, networks PDF BibTeX XML Cite \textit{M. Minsky} and \textit{S. Papert}, J. Assoc. Comput. Mach. 13, 281--286 (1966; Zbl 0166.00601) Full Text: DOI Link References: [1] RABIN, M., AND SCOTT, D. Finite automata and their decision problems. IBM J. Res. Develop. 3 (1959), 114-125. · Zbl 1461.68105 [2] KIEENE, S.C. Representation of events in nerve nets and finite automata. In Automata Studies, Shannon, C. E., and McCarthy, J. (Eds.), Princeton U. Press, Princeton, N. J., 1956, pp. 3-41. [3] RITCtIIE, R.W. Finite automata and the set of squares. J. ACM 10, 4 (Oct. 1963), 528- 531. 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.