edited by
18,998 views
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.

  1. $\phi$
  2. $\{\epsilon\}$
  3. $a^*$
  4. $\{a , \epsilon\}$
edited by

14 Answers

2 votes
2 votes
one more way is to convert this epsilon nfa to nfa and then take complement of the language but the only careful point is that the question has asked about the langauge formed by complement of the language accpeted by such nfa.

in nfa complementation doesnt work the same way that dfa does. so "complement of language accepted by nfa" and "complement of the machine" are two different things in case of nfa
0 votes
0 votes
Language being accepted by this NFA is : a+

complement of language = (∑*- a+)= (a* - a+)

a*={ϵ,a,aa,aaa,....}

a+={a,aa,aaa,......}

so, complement of language = {ϵ}
reshown by
Answer:

Related questions

24 votes
24 votes
4 answers
1
Arjun asked Sep 25, 2014
7,349 views
Given the language $L = \left\{ab, aa, baa\right\}$, which of the following strings are in $L^{*}$?$ abaabaaabaa$$ aaaabaaaa$$ baaaaabaaaab$$ baaaaabaa$$\text{1, 2 and 3}...
68 votes
68 votes
7 answers
2
9 votes
9 votes
4 answers
3
gatecse asked Sep 29, 2014
2,665 views
Given the sequence of terms, $\text{AD CG FK JP}$, the next term is$\text{OV}$$\text{OW}$$\text{PV}$$\text{PW}$
13 votes
13 votes
1 answer
4
gatecse asked Sep 29, 2014
2,797 views
Which one of the following options is the closest in meaning to the word given below?Mitigate DiminishDivulgeDedicateDenote