recategorized by
9,629 views

2 Answers

Best answer
10 votes
10 votes

L={ababn∣n≥0}∪{aban∣n≥0} 

L={ab, aba , abaa  ,abab  ,ababb,..........}

The minimum number of states of the non-deterministic finite automaton which accepts the language =5

Hence,Option(c)5 is the correct choice.

edited by
1 votes
1 votes

answer : 4

Correct me if I am wrong

Answer:

Related questions

1 votes
1 votes
1 answer
4
shivani2010 asked Jun 18, 2016
824 views
Which of the following regular expression identifies are true?(r+s)*=r*s*(r+s)*=r*+s*(r+s)*=(r*s*)*r*s*=r*+s*