0 0 votes How many states following DFA will have? 1. (0+1)*1(0+1)(0+1)(0+1)(0+1) 2. (0+1)*1(0+1)1(0+1)(0+1)(0+1) 3. (0+1)*(0+1)(0+1)(0+1)(0+1) Is there any formula also for such questions? Theory of Computation theory-of-computation + – Naveen Kumar 3 475 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Hemanth_13 commented Nov 12, 2018 reply Follow flag No idea bro.. its easy to write NFA but to convert and minimized will definitely kill time. 0 0 replyShare Naveen Kumar 3 commented Nov 13, 2018 reply Follow flag yes..that procedure will take a lot time. Ans for 1st part is 32. 0 0 replyShare Naveen Kumar 3 commented Nov 13, 2018 reply Follow flag but, for 1st question it can also be solved like:- 1 from right side(5th place) is constant. so, 2^5 no. of dfa. I'm not sure about this formula but, I have read it somewhere. I wanted to know about this formula. 0 0 replyShare Please log in or register to add a comment.