edited by
19,032 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

answer is c.  for complement of the language: changes to be done in DFA is to make final states to non final states and make non final to final states. then check. so ais the answer

edited by
Answer:

Related questions

24 votes
24 votes
4 answers
1
Arjun asked Sep 25, 2014
7,357 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,667 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,799 views
Which one of the following options is the closest in meaning to the word given below?Mitigate DiminishDivulgeDedicateDenote