Say that an NFA is ambiguous if it accepts some string along two different computation branches. Let

Question:

Say that an NFA is ambiguous if it accepts some string along two different computation branches. Let AMBIGNFA = {〈N〉| N is an ambiguous NFA}. Show that AMBIGNFA is decidable. One elegant way to solve this problem is to construct a suitable DFA and then run EDFA on it.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: