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

Nondeterminism: Multiple Transitions and Choices

Understand how NFAs can have multiple transitions for the same input symbol and what it means for computation to branch.

This lesson is for subscribers

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