Theory of Computation | Regular languages and finite automata | Question 2 Last Updated : 10 Sep, 2018 Improve Improve Like Article Like Save Share Report What is the complement of the language accepted by the NFA shown below? (A) A (B) B (C) C (D) D Answer: (B) Explanation: Quiz of this QuestionPlease comment below if you find anything wrong in the above post Like Article Suggest improvement Next Conversion of Regular Expression to Finite Automata Share your thoughts in the comments Add Your Comment Please Login to comment...