Say that an NFA is ambiguous if it accepts some string
Chapter , Problem 4.23(choose chapter or problem)
Say that an NFA is ambiguous if it accepts some string along two different computation branches. Let AMBIGNFA = {hNi| N is an ambiguous NFA}. Show that AMBIGNFA is decidable. (Suggestion: One elegant way to solve this problem is to construct a suitable DFA and then run EDFA on it.)
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