6.045J | Spring 2011 | Undergraduate

Automata, Computability, and Complexity

6-045js11-th.jpg

Description:

Lecture 3 introduces finite automata and provides several examples; this one includes a trap state, state d. Image by MIT OpenCourseWare.

Alt text:
Diagram showing transitions between four states.
Caption:
Lecture 3 introduces finite automata and provides several examples; this one includes a trap state, state d. (Image by MIT OpenCourseWare.)
Credit:
Image by MIT OpenCourseWare.
Diagram showing transitions between four states.

Course Info

As Taught In
Spring 2011
Learning Resource Types
Problem Sets
Lecture Notes