2 votes 2 votes Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L Theory of Computation theory-of-computation minimal-state-automata + – Anurag_s asked Aug 15, 2015 • retagged Aug 22, 2015 by Arjun Anurag_s 3.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 9 votes 9 votes States are 2013.. from S0 to S2012.. S2012 is final state, S0 is starting.. transition from S0--->S1--->......S2012 ---> S1.. Digvijay Pandey answered Aug 15, 2015 • selected Aug 15, 2015 by Praveen Saini Digvijay Pandey comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Mayankprakash commented Aug 10, 2018 reply Follow Share @digvijay Please suggest why in your solution last transition is from S2012-->S1? What is the significance of 'k' in the question? Please suggest. 0 votes 0 votes BASANT KUMAR commented Aug 10, 2018 reply Follow Share if you are not able to understand this question let reduce it for example instead of 2012 consider this language$a^{3k}$ then transition will be so->s1->s2->s3(final state)->s1 {for different value of k it will enter in the loop}. 0 votes 0 votes Tapabrat commented Apr 27, 2021 reply Follow Share In this question if the value of k=2 then it repeats the loop twice ??? is it true?? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L={a^nk / k>0} (n is constant) require n+1 states (from (S1 to Sn) + S0 Murali answered Nov 23, 2015 Murali comment Share Follow See all 0 reply Please log in or register to add a comment.
