in Theory of Computation edited by
873 views
1 vote
1 vote

What is the complement of the language accepted by the NFA shown below?

  1. $\not{O}$
  2. $\{\epsilon\}$
  3. $a^*$
  4. $\{a,\epsilon\}$
  1. $1$
  2. $2$
  3. $3$
  4. $4$
in Theory of Computation edited by
by
873 views

3 Comments

0
0
option B this is Null is correct
0
0
option B NULL
0
0

1 Answer

1 vote
1 vote

language is nothing but  $a^{+}$

complement of $a^{+}=a^{*}-a^{+}=\epsilon$

Option B

1 comment

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
0
Answer:

Related questions