0 votes 0 votes What is the answer for number of dfa states question,based on composition function? sai charan chakrala asked Feb 4, 2019 sai charan chakrala 875 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I think it will be 121. I marked it 2 Ahabnnc answered Feb 4, 2019 Ahabnnc comment Share Follow See all 3 Comments See all 3 3 Comments reply balchandar reddy san commented Feb 4, 2019 reply Follow Share how 121? 0 votes 0 votes Ahabnnc commented Feb 4, 2019 i edited by Ahabnnc Feb 4, 2019 reply Follow Share I am sorry, i just felt it will be 121. I think 6 states shud be minimum. Start state to any of the 5 values will fo to 5 other states and they will come back to start state only if same number comes again by some bijection. start state ill be final state too. So it should be 6 0 votes 0 votes Ahabnnc commented Feb 5, 2019 reply Follow Share I said 120 because there can be 120 bijection from 1-5 to 1-5. each will lead to a different state. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Answer should be 120. Total number of bijections are 5 factorial = 120. Each bijection represents a unique state in DFA. starting state is identity function and accepting state is also same. It cannot be minimized further. pratekag answered Feb 6, 2019 pratekag comment Share Follow See all 0 reply Please log in or register to add a comment.