2 votes 2 votes {a(kn)|k>=0 n is fixed digit} minimum no of states in DFA a) k b) n c) k+1 d) n+1 Theory of Computation finite-automata + – Prachi Agarwal asked Jul 31, 2016 • recategorized Jul 31, 2016 by Prashant. Prachi Agarwal 522 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply shivanisrivarshini commented Jul 31, 2016 reply Follow Share option b 0 votes 0 votes Arjun commented Jul 31, 2016 reply Follow Share Question is incomplete - no of states of what? 0 votes 0 votes LeenSharma commented Jul 31, 2016 reply Follow Share sir, Answer can be nk+1 for this. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes suppose n=2 then L=a2k , L={∈,a2,a4,a6,........} minimized Dfa for such a language is consist of 2 states similarly for L= akn no. of states for minimized dfa will be n so option b) Sanket_ answered Jul 31, 2016 Sanket_ comment Share Follow See 1 comment See all 1 1 comment reply papesh commented Jul 31, 2016 reply Follow Share Yup...I haven't check about epsilon... So n state is rt.. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Ans should be n Let n=4 we fixed.. If we put k=3...we will get a^(4*3) If we put k=5...we will get a^(4*5) So it is cycle of n and initial state is final state... So we need n state... papesh answered Jul 31, 2016 • edited Jul 31, 2016 by papesh papesh comment Share Follow See all 0 reply Please log in or register to add a comment.