857 views

3 Answers

1 votes
1 votes

i think ans should be 7 states, MFA will be as given below with slight modification..please correct me if i wrong..

edited by
0 votes
0 votes

L is defined as No. of a = 2 and |w| >= 3 over Σ = {a,b} 

L = { aab,aba, baa, aabb, abab, baba, ........}

So, Number of states in minimal DFA is 4.

edited by
Answer:

Related questions

0 votes
0 votes
2 answers
1
0 votes
0 votes
0 answers
2
ankit-saha asked Mar 24, 2022
338 views
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
0 votes
0 votes
2 answers
3
aditi19 asked Dec 14, 2018
1,493 views
Given following NFAfind the minimal equivalent DFA
1 votes
1 votes
1 answer
4
sripo asked Nov 6, 2018
2,973 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?