This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1799 of 2,872·40. Theory of Computation: Regular LanguagesPro lesson
NFA Example: Substring Recognition
Construct an NFA that recognizes strings containing a specific substring using nondeterministic guessing of pattern start.