{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:31:16Z","timestamp":1742394676876,"version":"3.38.0"},"reference-count":119,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780120121021"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1961]]},"DOI":"10.1016\/s0065-2458(08)60144-8","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T05:56:15Z","timestamp":1295416575000},"page":"379-421","source":"Crossref","is-referenced-by-count":26,"title":["The Theory of Automata, a Survey"],"prefix":"10.1016","author":[{"given":"Robert","family":"McNaughton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0065-2458(08)60144-8_bib1","first-page":"156","volume":"21","author":"Aizerman","year":"1960","journal-title":"Finite automata. Automation and Remote Control translation of Avtomatika i Telemekhanika"},{"key":"10.1016\/S0065-2458(08)60144-8_bib2","first-page":"92","article-title":"The present status of automatic translation of languages","volume":"I","author":"Bar-Hillel","year":"1960"},{"unstructured":"Bazilevsky, J., Questions in the theory of temporal logical functions (Questions in the Theory of Logical Machinestranslation of Voprosi Teoria Matematicheskikh Mashin, a volume of papers in Russian) 1958","key":"10.1016\/S0065-2458(08)60144-8_bib3"},{"year":"1959","author":"B\u00fcchi","series-title":"Regular Canonical Systems and Finite Automa, Dept. of Philosophy, Tech. Report No. 03105, 2794\u20137-T.","key":"10.1016\/S0065-2458(08)60144-8_bib4"},{"key":"10.1016\/S0065-2458(08)60144-8_bib5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second-order arithmetic and finite automata.","volume":"6","author":"B\u00fcchi","year":"1960","journal-title":"Z. math. Logik u. Grundlagen Math."},{"unstructured":"B\u00fcchi, J.R. Periodic Sets of Words and Finite Automata, Abstr. Intern. Cong. for Logic, Methodology and Phil. of Sci., p. 1. Stanford, California, 1960","key":"10.1016\/S0065-2458(08)60144-8_bib6"},{"key":"10.1016\/S0065-2458(08)60144-8_bib7","first-page":"98","article-title":"The nonexistence of certain algorithms in finite automata theory, Abstract.","volume":"5","author":"B\u00fcchi","year":"1958","journal-title":"Notices Am. Math. Soc."},{"key":"10.1016\/S0065-2458(08)60144-8_bib8","first-page":"147","article-title":"The Logic of Fixed and Growing Automata, Proc. Intern.","author":"Burks","year":"1957"},{"unstructured":"Burks, A.W., Computation, behavior and structure in fixed and growing automata, in Self-Organizing Systems, Papers of the Interdisciplinary Conf. on Self-Organizing Systems, Chicago, 1959, Yovits, M.C., pp. 282\u2013311. Pergamon Press, New York, 1960","key":"10.1016\/S0065-2458(08)60144-8_bib9"},{"key":"10.1016\/S0065-2458(08)60144-8_bib10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/320868.320880","article-title":"The logic of automata.","volume":"4","author":"Burks","year":"1957","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0065-2458(08)60144-8_bib11","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1109\/JRPROC.1953.274312","article-title":"Theory of logical nets.","volume":"41","author":"Burks","year":"1953","journal-title":"Proc. IRE"},{"doi-asserted-by":"crossref","unstructured":"Burks, A. W., and Wright, J. B., Sequence Generators and Digital Computers, 1961, unpublished.","key":"10.1016\/S0065-2458(08)60144-8_bib12","DOI":"10.1090\/pspum\/005\/9999"},{"unstructured":"Cadden, W. J., Sequential Circuit Theory, Dissertation. Princeton University, 1956.","key":"10.1016\/S0065-2458(08)60144-8_bib13"},{"key":"10.1016\/S0065-2458(08)60144-8_bib14","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/TCT.1959.1086511","article-title":"Equivalent sequential circuits.","volume":"CT-6","author":"Cadden","year":"1959","journal-title":"IRE Trans. on Circuit Theory"},{"year":"1958","author":"Caldwell","series-title":"Switching Circuits and Logical Design.","key":"10.1016\/S0065-2458(08)60144-8_bib15"},{"key":"10.1016\/S0065-2458(08)60144-8_bib16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/TIT.1956.1056813","article-title":"Three models for the description of language.","volume":"IT-2","author":"Chomsky","year":"1956","journal-title":"IRE Trans. on Information Theory"},{"key":"10.1016\/S0065-2458(08)60144-8_bib17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","article-title":"On certain formal properties of grammars.","volume":"2","author":"Chomsky","year":"1959","journal-title":"Inform. and Control"},{"key":"10.1016\/S0065-2458(08)60144-8_bib18","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/S0019-9958(58)90082-2","article-title":"Finite state languages.","volume":"1","author":"Chomsky","year":"1958","journal-title":"Inform. and Control"},{"key":"10.1016\/S0065-2458(08)60144-8_bib19","doi-asserted-by":"crossref","first-page":"40","DOI":"10.2307\/2269326","article-title":"A note on the Entscheidungsproblem.","volume":"1","author":"Church","year":"1936","journal-title":"J. Symbolic Logic"},{"year":"1941","author":"Church","series-title":"The Calculi of Lambda-Conversion, Ann. Math Studies No. 6","key":"10.1016\/S0065-2458(08)60144-8_bib20"},{"year":"1956","author":"Church","series-title":"Introduction to Mathematical Logic.","key":"10.1016\/S0065-2458(08)60144-8_bib21"},{"year":"1957","author":"Church","first-page":"3","key":"10.1016\/S0065-2458(08)60144-8_bib22"},{"year":"1954","author":"Copi","series-title":"Symbolic Logic.","key":"10.1016\/S0065-2458(08)60144-8_bib23"},{"key":"10.1016\/S0065-2458(08)60144-8_bib24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/320924.320931","article-title":"Realization of events by logical nets.","volume":"5","author":"Copi","year":"1958","journal-title":"Assoc. Computing Machinery"},{"key":"10.1016\/S0065-2458(08)60144-8_bib25","first-page":"167","article-title":"A note on universal Turing machines","author":"Davis","year":"1956"},{"year":"1958","author":"Davis","series-title":"Computability and Unsolvability.","key":"10.1016\/S0065-2458(08)60144-8_bib26"},{"key":"10.1016\/S0065-2458(08)60144-8_bib27","first-page":"183","article-title":"Computability by probabilistic machines","author":"deLeeuw","year":"1956"},{"unstructured":"Deuel, P., Univ. of British Columbia), The Behavioral Theory of Automata, 1961, unpublished.","key":"10.1016\/S0065-2458(08)60144-8_bib28"},{"key":"10.1016\/S0065-2458(08)60144-8_bib29","series-title":"Logic of Computers Group, Tech. Report No. 2722, 2794, 2755\u20136-T.","article-title":"Decision Problems of Finite Automata Design and Related Arithmetics","author":"Elgot","year":"1959"},{"key":"10.1016\/S0065-2458(08)60144-8_bib30","first-page":"648","article-title":"Decision problems of weak second order arithmetics and finite automata.","volume":"5","author":"Elgot","year":"1958","journal-title":"Notices Am. Math. Soc."},{"key":"10.1016\/S0065-2458(08)60144-8_bib31","first-page":"193","article-title":"Machine recognition of spoken words","volume":"I","author":"Fatehchand","year":"1960"},{"key":"10.1016\/S0065-2458(08)60144-8_bib32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1086\/287616","article-title":"Representation of sequential circuits in combinatory logic.","volume":"25","author":"Fitch","year":"1958","journal-title":"Phil. of Sci."},{"key":"10.1016\/S0065-2458(08)60144-8_bib33","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TEC.1960.5219887","article-title":"Characterizing experiments for finite-memory binary automata.","volume":"EC-9","author":"Gill","year":"1960","journal-title":"IRE Trans. on Electronic Computers"},{"key":"10.1016\/S0065-2458(08)60144-8_bib34","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/320932.320938","article-title":"On the length of the smallest uniform experiment which distinguishes the terminal states of a machine.","volume":"5","author":"Ginsburg","year":"1958","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0065-2458(08)60144-8_bib35","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/320964.320983","article-title":"On the reduction of superfluous states in a sequential machine.","volume":"6","author":"Ginsburg","year":"1959","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0065-2458(08)60144-8_bib36","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1959.5222696","article-title":"A technique for the reduction of a given machine to a minimal state machine.","volume":"EC-8","author":"Ginsburg","year":"1959","journal-title":"IRE Trans. on Electronic Computers"},{"key":"10.1016\/S0065-2458(08)60144-8_bib37","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/TEC.1959.5222056","article-title":"Synthesis of minimal state machines.","volume":"EC-8","author":"Ginsburg","year":"1959","journal-title":"IRE Trans. on Electronic Computers"},{"key":"10.1016\/S0065-2458(08)60144-8_bib38","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/321043.321045","article-title":"Connective properties preserved in minimal state machines.","volume":"7","author":"Ginsburg","year":"1960","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0065-2458(08)60144-8_bib39","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/321052.321056","article-title":"Sets of tapes accepted by different types of automata.","volume":"8","author":"Ginsburg","year":"1961","journal-title":"J. Assoc. Computing Machinery"},{"doi-asserted-by":"crossref","unstructured":"Ginsburg, S., Examples of Abstract Machines, 1961, unpublished.","key":"10.1016\/S0065-2458(08)60144-8_bib40","DOI":"10.1145\/355578.366521"},{"key":"10.1016\/S0065-2458(08)60144-8_bib41","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(59)90215-3","article-title":"On the mechanical simulation of habit-forming and learning.","volume":"2","author":"Gorn","year":"1959","journal-title":"Inform. and Control"},{"year":"1960","author":"Harris","series-title":"String Analysis for Center and Adjuncts, Department of Linguistics, Language Analysis Paper No. 5.","key":"10.1016\/S0065-2458(08)60144-8_bib42"},{"key":"10.1016\/S0065-2458(08)60144-8_bib43","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0019-9958(60)90744-0","article-title":"Symbolic analysis of a decomposition of information processing machines.","volume":"3","author":"Hartmanis","year":"1960","journal-title":"Inform. and Control"},{"unstructured":"Harvard Computation Laboratory, Bibliography of Works in Switching Theory, 1960, unpublished.","key":"10.1016\/S0065-2458(08)60144-8_bib44"},{"key":"10.1016\/S0065-2458(08)60144-8_bib45","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/JRPROC.1961.287776","article-title":"Self-organizing systems\u2014a review and commentary.","volume":"49","author":"Hawkins","year":"1961","journal-title":"Proc. IRE"},{"key":"10.1016\/S0065-2458(08)60144-8_bib46","series-title":"Proc. Intern. Conf. for Standards on a Common Language for Machine Searching and Translation. Cleveland, Ohio","article-title":"Steps Toward Grammatical Recognition","author":"Hiz","year":"1959"},{"year":"1959","author":"Holland","series-title":"Survey of Automata Theory, Memorandum of Project Michigan.","key":"10.1016\/S0065-2458(08)60144-8_bib47"},{"key":"10.1016\/S0065-2458(08)60144-8_bib48","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0016-0032(60)90590-1","article-title":"Cycles in logical nets.","volume":"270","author":"Holland","year":"1960","journal-title":"J. Franklin Inst."},{"doi-asserted-by":"crossref","unstructured":"Holland, J. Iterative Circuit Computers, Proc. Western Joint Computer Conf., pp. 259\u2013265. San Francisco, 1960","key":"10.1016\/S0065-2458(08)60144-8_bib49","DOI":"10.1145\/1460361.1460397"},{"key":"10.1016\/S0065-2458(08)60144-8_bib50","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0016-0032(54)90574-8","article-title":"The synthesis of sequential switching circuits.","volume":"257","author":"Huffman","year":"1954","journal-title":"J. Franklin Inst."},{"key":"10.1016\/S0065-2458(08)60144-8_bib51","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TCT.1959.1086614","article-title":"Canonical Forms for Information-lossless Finite-state Automata 1959 Intern. Symposium on Circuit and Information Theory; see IRE Trans.","volume":"CT-6","author":"Huffman","year":"1959","journal-title":"On Circuit Theory"},{"key":"10.1016\/S0065-2458(08)60144-8_bib52","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF02724674","article-title":"Notes on information-lossless finite-state automata.","volume":"13","author":"Huffman","year":"1959","journal-title":"Nuovo cimento"},{"year":"1958","author":"Humphrey","series-title":"Switching Circuits with Computer Applications.","key":"10.1016\/S0065-2458(08)60144-8_bib53"},{"key":"10.1016\/S0065-2458(08)60144-8_bib54","doi-asserted-by":"crossref","first-page":"136","DOI":"10.2206\/kyushumfs.12.136","article-title":"On some sequential machines and experiments.","volume":"A12","author":"Huzino","year":"1958","journal-title":"Mem. Fac. Sci. Kyushu Univ."},{"key":"10.1016\/S0065-2458(08)60144-8_bib55","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2206\/kyushumfs.12.159","article-title":"Reduction theorems on sequential machines.","volume":"A12","author":"Huzino","year":"1958","journal-title":"Mem. Fac. Sci. Kyushu Univ."},{"key":"10.1016\/S0065-2458(08)60144-8_bib56","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2206\/kyushumfs.13.53","article-title":"On the existence of Scheffer stroke class in the sequential machines.","volume":"A13","author":"Huzino","year":"1959","journal-title":"Mem. Fac. Sci. Kyushu Univ."},{"key":"10.1016\/S0065-2458(08)60144-8_bib57","doi-asserted-by":"crossref","first-page":"69","DOI":"10.2206\/kyushumfs.13.69","article-title":"Some properties of convolution machines and sigma composite machines.","volume":"A13","author":"Huzino","year":"1959","journal-title":"Mem. Fac. Sci. Kyushu Univ."},{"key":"10.1016\/S0065-2458(08)60144-8_bib58","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2206\/kyushumfs.14.50","article-title":"On some sequential equations.","volume":"A14","author":"Huzino","year":"1960","journal-title":"Mem. Fac. Sci. Kyushu Univ."},{"unstructured":"Ikeno, N., An Example of a Universal Turing Machine Japanese, read at the Natl. Convention of the Inst. Elec. Communications Engineers of Japan, 1958","key":"10.1016\/S0065-2458(08)60144-8_bib59"},{"key":"10.1016\/S0065-2458(08)60144-8_bib60","series-title":"Proc. Intern. Conf. for Standards on a Common Language for Machine Searching and Translation. Cleveland, Ohio","article-title":"Computation of Syntactic Structure","author":"Joshi","year":"1959"},{"key":"10.1016\/S0065-2458(08)60144-8_bib61","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1038\/scientificamerican0455-58","article-title":"Man viewed as a machine.","volume":"192","author":"Kemeny","year":"1955","journal-title":"Sci. American"},{"key":"10.1016\/S0065-2458(08)60144-8_bib62","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/BF01565439","article-title":"General recursive functions of natural numbers.","volume":"112","author":"Kleene","year":"1936","journal-title":"Math. Ann."},{"year":"1952","author":"Kleene","series-title":"Introduction to Metamathematics.","key":"10.1016\/S0065-2458(08)60144-8_bib63"},{"key":"10.1016\/S0065-2458(08)60144-8_bib64","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1956"},{"key":"10.1016\/S0065-2458(08)60144-8_bib65","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1002\/j.1538-7305.1960.tb03960.x","article-title":"Automata and finite automata.","volume":"39","author":"Lee","year":"1960","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0065-2458(08)60144-8_bib66","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/321075.321082","article-title":"Categorizing automata by W-machine programs.","volume":"8","author":"Lee","year":"1961","journal-title":"J. Assoc. Computing Machinery"},{"year":"1960","author":"Lee","series-title":"Learning Machines, Proc. Bionics Symposium","key":"10.1016\/S0065-2458(08)60144-8_bib67"},{"key":"10.1016\/S0065-2458(08)60144-8_bib68","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine.","volume":"3","author":"McCarthy","year":"1960","journal-title":"Commun. Assoc. Computing Machinery"},{"key":"10.1016\/S0065-2458(08)60144-8_bib69","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","article-title":"A logical calculus of the ideas imminent in nervous activity.","volume":"5","author":"McCulloch","year":"1943","journal-title":"Bull. Math. Biophys."},{"unstructured":"McNaughton, R., Symbolic Logic for Automata, Wright Air Development Division Tech. Note No. 60\u2013244. Cincinnati, Ohio, 1960","key":"10.1016\/S0065-2458(08)60144-8_bib70"},{"key":"10.1016\/S0065-2458(08)60144-8_bib71","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","article-title":"Regular expressions and state graphs for automata","volume":"EC-9","author":"McNaughton","year":"1960","journal-title":"IRE Trans. on Electronic Computers"},{"key":"10.1016\/S0065-2458(08)60144-8_bib72","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","article-title":"A method for synthesizing sequential circuits","volume":"34","author":"Mealy","year":"1955","journal-title":"Bell System Tech. J."},{"year":"1958","author":"Medvedev","key":"10.1016\/S0065-2458(08)60144-8_bib73"},{"year":"1960","author":"Minsky","series-title":"Recursive Unsolvability of Post's Problem of \"Tag,\" Tech. Report No. 54 G-0023.","key":"10.1016\/S0065-2458(08)60144-8_bib74"},{"year":"1960","author":"Minsky","series-title":"A 6-Symbol 7-State Universal Turing Machine, Tech. Report No. 54 G-0027.","key":"10.1016\/S0065-2458(08)60144-8_bib75"},{"key":"10.1016\/S0065-2458(08)60144-8_bib76","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/JRPROC.1961.287775","article-title":"Steps toward artificial intelligence.","volume":"49","author":"Minsky","year":"1961","journal-title":"Proc. IRE"},{"doi-asserted-by":"crossref","unstructured":"Moore, E.F., A Simplified Universal Turing Machine, Proc. Meeting Assoc. Computing Machinery, pp. 50\u201355. Toronto, Ontario, Canada, 1952","key":"10.1016\/S0065-2458(08)60144-8_bib77","DOI":"10.1145\/800259.808993"},{"key":"10.1016\/S0065-2458(08)60144-8_bib78","first-page":"129","article-title":"Gedanken experiments on sequential machines","author":"Moore","year":"1956"},{"key":"10.1016\/S0065-2458(08)60144-8_bib79","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1038\/scientificamerican1056-118","article-title":"Artificial living plants.","volume":"195","author":"Moore","year":"1956","journal-title":"Sci. American"},{"key":"10.1016\/S0065-2458(08)60144-8_bib80","first-page":"407","article-title":"Review of four papers by Penrose.","volume":"EC-8","author":"Moore","year":"1959","journal-title":"IRE Trans. on Electronic Computers"},{"key":"10.1016\/S0065-2458(08)60144-8_bib81","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","article-title":"Reliable circuits using less reliable relays.","volume":"262","author":"Moore","year":"1956","journal-title":"J. Franklin Inst."},{"unstructured":"Myhill, J. Linear Bounded Automata, Wright Air Development Division Tech. Note No. 60\u2013165. Cincinnati, Ohio, 1960","key":"10.1016\/S0065-2458(08)60144-8_bib82"},{"year":"1960","author":"Myhill","series-title":"Possibilities of Favorable Mutation in Self-Reproducing Automata, Lecture Notes, Summer Engineering Conf.","key":"10.1016\/S0065-2458(08)60144-8_bib83"},{"unstructured":"Myhill, J. Nerode, A. Tennenbaum S., Fundamental Concepts in the Theory of Systems, Wright Air Development Center Tech. Report No. 57\u2013624. Cincinnati, Ohio, 1957","key":"10.1016\/S0065-2458(08)60144-8_bib84"},{"key":"10.1016\/S0065-2458(08)60144-8_bib85","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","article-title":"Linear automaton transformations.","volume":"9","author":"Nerode","year":"1958","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/S0065-2458(08)60144-8_bib86","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1109\/TEC.1958.5222528","article-title":"Logical machine design: a selected bibliography.","volume":"EC-7","author":"Netherwood","year":"1958","journal-title":"IRE Trans. on Electronic Computers"},{"key":"10.1016\/S0065-2458(08)60144-8_bib87","first-page":"12","article-title":"Automatic syntactic analysis and the pushdown store","author":"Oettinger","year":"1961","journal-title":"Proc. Symposia in Appl. Math.Am. Math. Soc.)"},{"unstructured":"Patterson, G. W., Logical Syntax and Transformation Rules, Proc. 2nd Symposium on Large-Scale Digital Calculating Machinery, pp. 125\u2013133. Cambridge, Mass., 1949.","key":"10.1016\/S0065-2458(08)60144-8_bib88"},{"key":"10.1016\/S0065-2458(08)60144-8_bib89","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","article-title":"Minimizing the number of states in incompletely specified sequential switching functions","volume":"EC-8","author":"Paull","year":"1959","journal-title":"IRE Trans. on Electronic Computers"},{"key":"10.1016\/S0065-2458(08)60144-8_bib90","first-page":"57","article-title":"Developments in the theory of self-replication.","volume":"31","author":"Penrose","year":"1960","journal-title":"New Biol."},{"key":"10.1016\/S0065-2458(08)60144-8_bib91","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2269031","article-title":"Finite combinatory processes\u2014formulation I.","volume":"1","author":"Post","year":"1936","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0065-2458(08)60144-8_bib92","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems.","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Research and Development"},{"key":"10.1016\/S0065-2458(08)60144-8_bib93","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/320924.320930","article-title":"Sequential functions.","volume":"5","author":"Raney","year":"1958","journal-title":"J. Assoc. Computing Machinery"},{"year":"1960","author":"Reitman","series-title":"Information-processing Languages and Heuristic Programs: a New Stage in the Bead Game, Proc. Bionics Symposium","key":"10.1016\/S0065-2458(08)60144-8_bib94"},{"unstructured":"Ritchie, R. W., Classes of Recursive Functions of Predictable Complexity, Doctoral dissertation. Princeton University, Princeton, New Jersey, submitted 1960.","key":"10.1016\/S0065-2458(08)60144-8_bib95"},{"unstructured":"Rose, G.F., An extended notion of computability, Abstr. Intern. Congr. for Logic, Methodology and Phil. of Sci., p. 14. Stanford, California, 1960","key":"10.1016\/S0065-2458(08)60144-8_bib96"},{"key":"10.1016\/S0065-2458(08)60144-8_bib97","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/JRPROC.1960.287598","article-title":"Perceptron simulation experiments.","volume":"48","author":"Rosenblatt","year":"1960","journal-title":"Proc. IRE"},{"year":"1957","author":"Rubinoff","first-page":"241","key":"10.1016\/S0065-2458(08)60144-8_bib98"},{"key":"10.1016\/S0065-2458(08)60144-8_bib99","first-page":"165","article-title":"Programming computers to play games","volume":"I","author":"Samuel","year":"1960"},{"key":"10.1016\/S0065-2458(08)60144-8_bib100","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1109\/JRPROC.1953.274273","article-title":"Computers and automata.","volume":"41","author":"Shannon","year":"1953","journal-title":"Proc. IRE"},{"key":"10.1016\/S0065-2458(08)60144-8_bib101","first-page":"157","article-title":"A universal Turing machine with two internal states","author":"Shannon","year":"1956"},{"key":"10.1016\/S0065-2458(08)60144-8_bib102","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1090\/S0002-9904-1958-10214-1","article-title":"Neumann's contribution to automata theory.","volume":"64","author":"von Shannon","year":"1958","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/S0065-2458(08)60144-8_bib103","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","article-title":"The reduction of two-way automata to one-way automata","volume":"3","author":"Shepherdson","year":"1959","journal-title":"IBM J. Research and Development"},{"unstructured":"Shepherdson, J.C. Sturgis, H.E., The Computability of Partial Recursive Functions, Abstr. Intern. Congr. for Logic, Methodology and Phil. of Sci., p. 17. Stanford, California, 1960","key":"10.1016\/S0065-2458(08)60144-8_bib104"},{"key":"10.1016\/S0065-2458(08)60144-8_bib105","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/BF03047026","article-title":"On the synthesis of finite sequential machines.","volume":"50","author":"Srinivasan","year":"1959","journal-title":"Proc. Indian Acad. Sci."},{"key":"10.1016\/S0065-2458(08)60144-8_bib106","first-page":"1005","article-title":"On operators realizable in logical nets.","volume":"112","author":"Trakhtenbrot","year":"1957","journal-title":"Doklady Akad. Nauk S.S.S.R."},{"key":"10.1016\/S0065-2458(08)60144-8_bib107","first-page":"646","article-title":"Synthesis of logic networks whose operators are described by means of single-place predicate calculus.","volume":"118","author":"Trakhtenbrot","year":"1958","journal-title":"Doklady Akad. Nauk S.S.S.R."},{"issue":"2","key":"10.1016\/S0065-2458(08)60144-8_bib108","first-page":"230","article-title":"On computable numbers with an application to the Entscheidungsproblem.","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. London Math. Soc."},{"unstructured":"von Neumann, J., The general and logical theory of automata, in Cerebral Mechanisms in Behavior\u2014The Hixon SymposiumL. A. Jeffries, ed.), 1951; Reprinted in The World of Mathematics J. R. Newman, ed.), Vol. 4, pp. 2070\u20132098. Simon & Shuster, New York, 1956.","key":"10.1016\/S0065-2458(08)60144-8_bib109"},{"key":"10.1016\/S0065-2458(08)60144-8_bib110","first-page":"43","article-title":"Probabilistic logics and the synthesis of reliable organism from unreliable components","author":"von Neumann","year":"1956"},{"year":"1958","author":"von Neumann","series-title":"The Computer and the Brain","key":"10.1016\/S0065-2458(08)60144-8_bib111"},{"year":"1962","author":"von Neumann","key":"10.1016\/S0065-2458(08)60144-8_bib112"},{"year":"1962","author":"von Neumann","key":"10.1016\/S0065-2458(08)60144-8_bib113"},{"key":"10.1016\/S0065-2458(08)60144-8_bib114","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/320856.320867","article-title":"A variant to Turing's theory of computing machines","volume":"4","author":"Wang","year":"1957","journal-title":"J. Assoc. Computing Machinery"},{"year":"1957","author":"Wang","first-page":"181","key":"10.1016\/S0065-2458(08)60144-8_bib115"},{"year":"1948","author":"Wiener","series-title":"Cybernetics.","key":"10.1016\/S0065-2458(08)60144-8_bib116"},{"year":"1959","author":"Willis","first-page":"290","key":"10.1016\/S0065-2458(08)60144-8_bib117"},{"unstructured":"Yamada, H., Counting by a Class of Growing Automata, Doctoral dissertation. University of Pennsylvania, Philadelphia, Pennsylvania, 1960.","key":"10.1016\/S0065-2458(08)60144-8_bib118"},{"unstructured":"Yamada, H.A., mode of real time operations of a subclass of Turing machines and the existence of a subclass of recursive functions which are not real time computable, to appear in IRE Trans. on Electronic ComputersEC-10, 1961","key":"10.1016\/S0065-2458(08)60144-8_bib119"}],"container-title":["Advances in Computers","Advances in Computers Volume 2"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T22:33:09Z","timestamp":1740868389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0065245808601448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1961]]},"ISBN":["9780120121021"],"references-count":119,"URL":"https:\/\/doi.org\/10.1016\/s0065-2458(08)60144-8","relation":{},"ISSN":["0065-2458"],"issn-type":[{"type":"print","value":"0065-2458"}],"subject":[],"published":{"date-parts":[[1961]]}}}