6.045J | Spring 2011 | Undergraduate

Automata, Computability, and Complexity

Lecture Notes

MIT6_045JS11_lec04.pdf

Description:

This resource contains information related to nondeterministic finite automata, nondeterministic finite automata, and viewing computations as a tree.

Resource Type:
Lecture Notes
pdf
303 kB
MIT6_045JS11_lec04.pdf

Course Info

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