Converting each of the final states of F to non-final states of-04690
Converting each of the final states of F to non-final states of F to final states, FA thus obtained will reject every string belonging to L and will accept every string, defined over, not belonging toL is called
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Final Term - Quiz No.11.
Converting each of the final states of F to non-final states of F to final states, FA thus obtained will reject every string belonging to L and will accept every string, defined over, not belonging toL is called
transition graph of L
regular expression of L
complement of L
finite Automation of L
