Automata, formal languages abstract switching, and computability in a Ph.D. computer science program

By Robert McNaughton

Communications of the ACM, Vol. 11 No. 11, Pages 738-740
10.1145/364139.364150

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.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

Automata, formal languages abstract switching, and computability in a Ph.D. computer science program

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine