0 votes 0 votes Consider the following NFA for ∑={ g,a,t,e}.Find the number of states in equivalent minimal dfa. a)4 b)5 c)6 d)8 shipra tressa asked Aug 16, 2018 shipra tressa 1.4k views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Deepanshu commented Aug 16, 2018 reply Follow Share I AM GETTING 8 STATES. IS IT CORRECT??? 0 votes 0 votes shipra tressa commented Aug 16, 2018 reply Follow Share 5 states 0 votes 0 votes Deepanshu commented Aug 16, 2018 reply Follow Share @shipra tressa I AM GETTING 5 FINAL STATES AND 3 NONFINAL STATES . WHAT ARE YOU GETTING IN GENERAL? 0 votes 0 votes arvin commented Aug 16, 2018 reply Follow Share did u minimised the dfa u got? 0 votes 0 votes Deepanshu commented Aug 16, 2018 reply Follow Share @arvin nope i just convert and just leave it there . thanku again 0 votes 0 votes arvin commented Aug 16, 2018 reply Follow Share no worries its the mistakes we do build our concepts :) 0 votes 0 votes Deepanshu commented Aug 16, 2018 reply Follow Share yepp now i got 5 states now 0 votes 0 votes arvin commented Aug 16, 2018 reply Follow Share good :) 0 votes 0 votes shipra tressa commented Aug 16, 2018 reply Follow Share kindly send the result 0 votes 0 votes Deepanshu commented Aug 16, 2018 reply Follow Share AS I JUST DID IT IN ROUGH WORK SO I WILL TELL YOU PROCEDURE. 1 FIRST MAKE TABLE OF NFA 2 THEN CONVERT THAT TO DFA ,3.THEN DFA TO MINIMAL DFA. YOU JUST TELL ME WHERE ARE YOU NOT GETTING THE CONCEPT ???? I WILL TRY TO FIX THAT 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Total no. of states = 5 Swapnil Naik answered Aug 16, 2018 Swapnil Naik comment Share Follow See 1 comment See all 1 1 comment reply shipra tressa commented Aug 16, 2018 reply Follow Share thanks 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Its anwer is 5 Chandrabhan Vishwa 1 answered Aug 16, 2018 Chandrabhan Vishwa 1 comment Share Follow See all 0 reply Please log in or register to add a comment.