Given a regular expression, construct a nondeterministic
Chapter 12, Problem 12.10(choose chapter or problem)
Given a regular expression, construct a nondeterministic finite-state automaton that recognizes the set that this expression represents.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer