1 votes 1 votes What is the complement of the language accepted by the NFA shown below? $\not{O}$ $\{\epsilon\}$ $a^*$ $\{a,\epsilon\}$ $1$ $2$ $3$ $4$ Theory of Computation nielit2017july-scientistb-cs theory-of-computation finite-automata + – admin asked Mar 30, 2020 edited Nov 21, 2022 by gatecse admin 863 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply haralk10 commented Apr 8, 2020 reply Follow Share https://gateoverflow.in/44/gate2012-12 0 votes 0 votes HiteshVaish commented Jun 21, 2020 reply Follow Share option B this is Null is correct 0 votes 0 votes Sanandan commented Sep 1, 2020 reply Follow Share option B NULL 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes language is nothing but $a^{+}$ complement of $a^{+}=a^{*}-a^{+}=\epsilon$ Option B Mohit Kumar 6 answered May 31, 2020 Mohit Kumar 6 comment Share Follow See 1 comment See all 1 1 comment reply rish1602 commented Jul 25, 2021 reply Follow Share right..first convert epsilon NFA to DFA and then convert to complement by interchanging final to non final and non final to final state. 0 votes 0 votes Please log in or register to add a comment.