retagged by
486 views

3 Answers

2 votes
2 votes

Minimal DFA contains 4 states only. the following figure shows minimal DFA for a given regular expression:

$L={\epsilon,ba,baba,bababa….,aba,aaba,aaaba,….ababa, aababa...\infty}$

 

 

edited by
0 votes
0 votes

 

 

 

only four state is sufficient  

Related questions

3 votes
3 votes
3 answers
1
BHOJARAM asked Dec 13, 2021
829 views
complement of CFL can never be CFL.please explain if the above statement is true of false?
0 votes
0 votes
1 answer
2
Nancy Pareta asked Jul 25, 2018
1,119 views
Dpda acceptance by empty stack is equivalent in power as dpda acceptance by final state?explain