A Variant to Turing's Theory of Computing Machines
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Finite Automata, Pattern Recognition and Perceptrons
Journal of the ACM (JACM)
5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
Journal of the ACM (JACM)
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
On The Ambiguity Problem of Backus Systems
Journal of the ACM (JACM)
Some Recursively Unsolvable Problems in ALGOL-Like Languages
Journal of the ACM (JACM)
Operations Which Preserve Definability in Languages
Journal of the ACM (JACM)
Computability of Recursive Functions
Journal of the ACM (JACM)
Solvability of Machine Mappings of Regular Sets to Regular Sets
Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages
Journal of the ACM (JACM)
A class of unambiguous computer languages
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
Introduction to Mathematical Machine Theory
Introduction to Mathematical Machine Theory
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
Hi-index | 0.00 |
I WAS INVITED to present a survey of the theory of automata. Since there are already several surveys, especially the very competent ones of Chomsky 10, McNaughton 37, and Rogers 54, all of which deal with various aspects of the theory of automata and more, I shall confine myself to an exposition of what might loosely be called a “philosophy of automata”. On the way, however, I hope to touch upon certain developments of the subject which have come about since McNaughton's 1961 paper. Readers who feel they are up on the theory may wish to omit sections 2 and 3.