The transition graph for an NFA that recognizes the language a-08029
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
This multiple choice question (MCQ) is related to the book/course
vu cs606 Compiler Construction.
It can also be found in
vu cs606 Mid Term - Quiz No.4.
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
{0,1}
{0}
{0,1,2}
{0,1,2,3}
