0 0 votes construct dfa over {a} accepting all strings which have number of a's divisible by 2 and no of a's divisible by 4. what is the minimum no of states in dfa? ans is 2 states?? Theory of Computation theory-of-computation + – aaru14 648 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply LeenSharma commented Nov 15, 2017 reply Follow flag yes, 2 states needed. 0 0 replyShare saxena0612 commented Nov 15, 2017 reply Follow flag aa is not in language ! 0 0 replyShare Please log in or register to add a comment.
0 0 votes is there "AND" or "OR" between these two conditions ?? if "AND" is there then there will be 4 states. If "OR" is there then there will be 2 states. Ashwin Kulkarni answered Nov 15, 2017 Ashwin Kulkarni comment Share Follow 0 reply Please log in or register to add a comment.
