Automata, formal languages abstract switching, and computability in a Ph.D. computer science program
Robert McNaughton · Communications of the ACM · 1968
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.