Theory of Computation | Regular languages and finite automata | Question 2

What is the complement of the language accepted by the NFA shown below?

gatecs2012automata
(A) A
(B) B
(C) C
(D) D


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post



My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.