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

NFA Definition and Components

Define nondeterministic finite automata, their five-tuple notation, and how they differ from DFAs in transition functions.

This lesson is for subscribers

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