0 0 votes what will be the DFA for RE – (a*ba)* Theory of Computation theory-of-computation regular-expression + – Dknights 1.0k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
2 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}$ Hira Thakur answered Nov 10, 2022 • edited Nov 11, 2022 by Hira Thakur Hira Thakur comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes only four state is sufficient Chandrabhan Vishwa 1 answered Nov 10, 2022 • edited Nov 11, 2022 by Chandrabhan Vishwa 1 Chandrabhan Vishwa 1 comment Share Follow See all 2 Comments 2 2 Comments reply Dknights commented Nov 10, 2022 reply Follow flag but RE – (a*ba)* is also accepting epsilon but above DFA is not accepting epsilon. 0 0 replyShare Hira Thakur commented Nov 11, 2022 reply Follow flag Dknights Given DFA accepts $\epsilon$ because initial state in the final state 0 0 replyShare Please log in or register to add a comment.
0 0 votes 4 State abhinowKatore answered Nov 10, 2022 • edited Nov 11, 2022 by abhinowKatore abhinowKatore comment Share Follow See all 2 Comments 2 2 Comments reply Chandrabhan Vishwa 1 commented Nov 11, 2022 reply Follow flag i think dead state also included 0 0 replyShare Hira Thakur commented Nov 11, 2022 reply Follow flag abhinowKatore above finite automata is not DFA, not even minimal. 0 0 replyShare Please log in or register to add a comment.
