Converting each of the final states of F to non-final states and old 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 to L. is called?

(A) Complement of L
(B) Finite Automata of L
(C) Transition Graph of L
(D) Regular expression of L

Related Posts 👇

Leave a Reply

Your email address will not be published. Required fields are marked *

error: Content is protected !!