Course contentsShow
Computer Science
Lesson 1798 of 2,87240. Theory of Computation: Regular LanguagesPro lesson

Designing NFAs: Exploiting Nondeterminism

Learn strategies for designing NFAs that guess or branch on uncertain information, creating simpler machines than DFAs.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.