71 votes 71 votes What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$ Theory of Computation gatecse-2012 finite-automata easy theory-of-computation + – gatecse asked Aug 5, 2014 edited Feb 17, 2018 by kenzou gatecse 19.0k views answer comment Share Follow See all 17 Comments See all 17 17 Comments reply Show 14 previous comments King_in_the_north commented Nov 12, 2019 reply Follow Share "Complement of language of a given NFA ≠≠ Language accepted by Complement of that given NFA. " I think it is may or may not be equal. Please verify. 2 votes 2 votes raja11sep commented Jul 12, 2021 reply Follow Share Correct. In the case of NFA, by complementing automata we will not get the complement of language. In some cases, it may give complement of the language but it’s not always true. That’s why there no concept of a complement of NFA. 1 votes 1 votes raja11sep commented Jul 12, 2021 reply Follow Share L= { a, a.$\epsilon$.$\epsilon$.a, a.$\epsilon$.$\epsilon$.a.$\epsilon$.$\epsilon$.a, ……}={a,aa,aaa,….} a.$\epsilon$=$\epsilon$.a=a. here $\epsilon$ is empty string(“”). The complement of a NFA doesn't give us the complement of the language it is accepting. Better you find out the language it is accepting and then complement the language. I think this is the most important part which is being ignored. 5 votes 5 votes Please log in or register to add a comment.
Best answer 89 votes 89 votes The language being accepted is $a^+$. So, complement of the language is $\{\epsilon\}$. Arjun answered Aug 21, 2014 selected Aug 22, 2014 by gatecse Arjun comment Share Follow See all 16 Comments See all 16 16 Comments reply Show 13 previous comments KUSHAGRA गुप्ता commented Dec 2, 2019 reply Follow Share $1.\ \varepsilon- NFA\ to\ NFA$ $2.\ NFA\ to\ DFA$ $3.\ Compliment$ $Ans: \varepsilon$ 20 votes 20 votes Madhab commented Aug 31, 2020 reply Follow Share very good explanation . 0 votes 0 votes Subbu. commented Sep 10, 2021 i edited by JAINchiNMay Nov 16, 2022 reply Follow Share Don't Stuck at any where.... As a Gate aspirant you should read question carefully.. They are asking compliment of language , not asking about compliment of NFA Machine.. NFA accepts {a+} Complement of the Language ={epsilon} Complement of NFA MACHINE ={a*} 13 votes 13 votes Please log in or register to add a comment.
42 votes 42 votes NFA accepts the language L=a+ and ∑={a} the complement of L=∑*- a+=a*-a+={∊} so answer is B vnc answered Nov 27, 2015 vnc comment Share Follow See all 2 Comments See all 2 2 Comments reply tusharp commented Nov 17, 2018 reply Follow Share Complement does not work with NFA always. I don't think this approach is correct even though it works for this example. 0 votes 0 votes Gurdeep Saini commented Jul 9, 2019 reply Follow Share @tusharp he did not make the complement of NFA, he made the complement of language which always works 3 votes 3 votes Please log in or register to add a comment.
13 votes 13 votes Ans. varunraj answered Mar 16, 2018 varunraj comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes the language is a+ ..... compliment is {$\varepsilon$} Tarani Behera answered Nov 28, 2015 edited Jan 14, 2018 by Puja Mishra Tarani Behera comment Share Follow See all 0 reply Please log in or register to add a comment.