1 1 vote Theory of Computation + – Parshu gate 1.4k views answer comment Share Follow Print See all 9 Comments 9 9 Comments reply Anu007 commented Jan 6, 2018 reply Follow flag i am getting 3 ... 0 0 replyShare gatecse123 commented Jan 6, 2018 reply Follow flag [1,6] [2,5] [3,4] 0 0 replyShare hs_yadav commented Jan 6, 2018 reply Follow flag yes....it is three... (1,6) (2,5) (3,4) 0 0 replyShare VIDYADHAR SHELKE 1 commented Jan 6, 2018 reply Follow flag Can you explain plz..how u got I am confused 0 0 replyShare hs_yadav commented Jan 6, 2018 reply Follow flag @ VIDYADHAR SHELKE 1 u can use the procedure of minimization....a DFA 1 1 replyShare VIDYADHAR SHELKE 1 commented Jan 6, 2018 reply Follow flag Thank you.. 0 0 replyShare rajupatat17 commented Aug 31, 2019 reply Follow flag state 2 and 5 are unreachable , so would it not be 2 states [1,6] and [3,4]. ? 0 0 replyShare Mayank patel commented Sep 16, 2019 reply Follow flag Ans is 2 . (1, 6) and (4, 3) Bqz language accepted by the above should not affect from the unreachable States. So first remove unreachable States than find equivalence classes. 0 0 replyShare Priyadrasta Raut commented Aug 25, 2020 reply Follow flag I think the unreachability from the starting state is not applicable here and answer should be 3 0 0 replyShare Please log in or register to add a comment.
