The Theory of Automata, a Survey

[1]  J. Neumann.  The General and Logical Theory of Au-tomata , 1963 .

[2]  Andrzej Blikle.  Review: B. A. Trahtenbrot, On Operators Realizable in Logical Nets , 1962 .

[3]  Seymour Ginsburg,et al.  Examples of Abstract Machines , 1962, IRE Trans. Electron. Comput..

[4]  A W BURKS,et al.  Computation, behavior, and structure in fixed and growing automata. , 2007, Behavioral science.

[5]  Marvin Minsky,et al.  Steps toward Artificial Intelligence , 1995, Proceedings of the IRE.

[6]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1962 .

[7]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[8]  C. Y. Lee.  Categorizing Automata by W-Machine Programs , 1961, JACM.

[9]  A. Burks,et al.  SEQUENCE GENERATORS AND DIGITAL COMPUTERS , 1961 .

[10]  Anthony G. Oettinger,et al.  Automatic syntactic analysis and the pushdown store , 1961 .

[11]  J. K. Hawkins.  Self-Organizing Systems-A Review and Commentary , 1961, Proceedings of the IRE.

[12]  Seymour Ginsburg,et al.  Sets of Tapes Accepted by Different Types of Automata , 1961, JACM.

[13]  Arthur Gill,et al.  Characterizing Experiments for Finite-Memory Binary Automata , 1960, IRE Trans. Electron. Comput..

[14]  Seymour Ginsburg,et al.  Connective Properties Preserved in Minimal State Machines , 1960, JACM.

[15]  C. Y. Lee.  Automata and finite automata , 1960 .

[16]  J. Holland.  Cycles in logical nets , 1960 .

[17]  Juris Hartmanis,et al.  Symbolic Analysis of a Decomposition of Information Processing Machines , 1960, Inf. Control..

[18]  John H. Holland,et al.  Iterative circuit computers , 1960, IRE-AIEE-ACM '60 (Western).

[19]  Frank Rosenblatt,et al.  Perceptron Simulation Experiments , 1960, Proceedings of the IRE.

[20]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[21]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[22]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[23]  S. Huzino.  ON SOME SEQUENTIAL EQUATIONS , 1960 .

[24]  L. Penrose.  Developments in the theory of self-replication. , 1960 .

[25]  Arthur L. Samuel,et al.  Programming Computers to Play Games , 1960, Adv. Comput..

[26]  Richard Fatehchand,et al.  Machine Recognition of Spoken Words , 1960, Adv. Comput..

[27]  Yehoshua Bar-Hillel,et al.  The Present Status of Automatic Translation of Languages , 1960, Adv. Comput..

[28]  Seymour Ginsburg,et al.  Synthesis of Minimal-State Machines , 1959, IRE Trans. Electron. Comput..

[29]  D. A. Huffman,et al.  Notes on information-lossless finite-state automata , 1959 .

[30]  Stephen H. Unger,et al.  Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..

[31]  Saul Gorn,et al.  On the Mechanical Simulation of Habit-Forming and Learning , 1959, Inf. Control..

[32]  Seymour Ginsburg.  A Technique for the Reduction of a Given Machine to a Minimal-State Machine , 1959, IRE Trans. Electron. Comput..

[33]  Rangaswamy Narasimhan,et al.  On the synthesis of finite sequential machines , 1959 .

[34]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[35]  David A. Huffman,et al.  Canonical forms for information-lossless finite-state logical machines , 1959, IRE Trans. Inf. Theory.

[36]  Seymour Ginsburg,et al.  On the Reduction of Superfluous States in a Sequential Machine , 1959, JACM.

[37]  John C. Shepherdson,et al.  The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[38]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[39]  W. Cadden,et al.  Equivalent Sequential Circuits , 1959 .

[40]  Douglas B. Netherwood.  Logical Machine Design II: A Selected Bibliography , 1958, IRE Trans. Electron. Comput..

[41]  S. Huzino.  ON THE EXISTENCE OF SHEFFER STROKE CLASS IN THE SEQUENTIAL MACHINES , 1959 .

[42]  S. Huzino.  SOME PROPERTIES OF CONVOLUTION MACHINES AND σ-COMPOSITE MACHINES , 1959 .

[43]  David G. Willis,et al.  Plastic neurons as memory elements , 1959, IFIP Congress.

[44]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[45]  F. B. Fitch.  Representation of Sequential Circuits in Combinatory Logic , 1958, Philosophy of Science.

[46]  Seymour Ginsburg,et al.  On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine , 1958, JACM.

[47]  George A. Miller,et al.  Finite State Languages , 1958, Inf. Control..

[48]  C. Shannon.  Von Neumann's contributions to automata theory , 1958 .

[49]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[50]  Calvin C. Elgot,et al.  Realization of Events by Logical Nets , 1958, JACM.

[51]  George N. Raney,et al.  Sequential Functions , 1958, JACM.

[52]  S. Huzino.  ON SOME SEQUENTIAL MACHINES AND EXPERIMENTS , 1958 .

[53]  S. Huzino.  REDUCTION THEOREMS ON SEQUENTIAL MACHINES , 1958 .

[54]  Watts S. Humphrey,et al.  Switching circuits with computer applications , 1958 .

[55]  Arthur W. Burks,et al.  The Logic of Automata—Part I , 1957, JACM.

[56]  Hao Wang,et al.  A Variant to Turing's Theory of Computing Machines , 1957, JACM.

[57]  E. F. Moore.  Artificial Living Plants , 1956 .

[58]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[59]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[60]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[61]  J. Kemeny.  Man Viewed as a Machine , 1955 .

[62]  A. Burks,et al.  Theory of Logical Nets , 1953, Proceedings of the IRE.

[63]  Claude E. Shannon,et al.  Computers and Automata , 1953, Proceedings of the IRE.

[64]  E. F. Moore.  A simplified universal Turing machine , 1952, ACM '52.

[65]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[66]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[67]  A. Church.  The calculi of lambda-conversion , 1941 .

[68]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[69]  S. Kleene,et al.  General Recursive Functions of Natural Numbers. , 1937 .

[70]  S. Kleene.  General recursive functions of natural numbers , 1936 .

[71]  Emil L. Post.  Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.

[72]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.