1,920 views
1 votes
1 votes

Consider this FA:

How many strings will be there in the complement of the language accepted by this Finite Automata?
(a) Infinite

(b) 2

(c) 3

(d) 0

3 Answers

Best answer
2 votes
2 votes
convert it to dfa...dfa will have 4 states(all 4 accepting states)...complementing it will lead to dfa with '0' accepting states...so it will not accept anything...

option (d) correct
selected by
0 votes
0 votes
Loop is there in the complement: Infinite
0 votes
0 votes

The Given FA is DFA as there are transitions for every symbols of alphabet = {a,b} from every state.

The complement of FA is ,

Since it contains loop over Final state, it can accept any number of a's and b's at final state which leads to Infinite language set.

Option a is correct

Related questions

0 votes
0 votes
1 answer
1
5 votes
5 votes
1 answer
2