0 votes 0 votes How many number of states are there in the minimized dfa that accepts the language L= a^ 3(n+1) Mudita asked Jul 27, 2018 Mudita 181 views answer comment Share Follow See 1 comment See all 1 1 comment reply arvin commented Jul 28, 2018 i moved by arvin Dec 21, 2018 reply Follow Share for n>=0 L={a^3,a^6,a^9...............} dfa will have 4states. (one a from last state will goto 2nd state) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 4 state is required. abhishekmehta4u answered Jul 28, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.