Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Brains, machines, and mathematics (2nd ed.)
Brains, machines, and mathematics (2nd ed.)
Computation: finite and infinite machines
Computation: finite and infinite machines
Introduction to Mathematical Machine Theory
Introduction to Mathematical Machine Theory
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Sequential Machines: Selected Papers
Sequential Machines: Selected Papers
A survey of the literature in computer science education since curriculum '68
Communications of the ACM
Computer Science Programs at Universities Awarding the Ph.D. Degree
SIGCPR '74 Proceedings of the twelfth annual SIGCPR conference
| Hi-index | 48.23 |
A number of courses are listed in the area described as automata, formal languages, abstract switching, and computability, that might be available to a Ph.D. student in computer science. A brief catalog description of each course is supplied and the role of each of the courses in the graduate program is discussed.