3 votes 3 votes A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}? Theory of Computation finite-automata + – jaiganeshcse94 asked Jul 27, 2016 • edited Jul 28, 2016 by Prashant. jaiganeshcse94 5.0k views answer comment Share Follow See 1 comment See all 1 1 comment reply jaiganeshcse94 commented Apr 12, 2017 reply Follow Share please refer this link: https://books.google.co.in/books?id=LdAAN89TUscC&pg=PA61&lpg=PA61&dq=dfa+for+A+%3D+%7Bw%7C+w+contains+at+least+one+1+and+an+even+number+of+0s+follow+the+last+1%7D?&source=bl&ots=BuG8yhViqa&sig=O8LovjMkcyfAzvax32JJweK6Ifk&hl=en&sa=X&ved=0ahUKEwj0hs_mjZ_TAhUIsY8KHTHwDgYQ6AEIPjAG#v=onepage&q=dfa%20for%20A%20%3D%20%7Bw%7C%20w%20contains%20at%20least%20one%201%20and%20an%20even%20number%20of%200s%20follow%20the%20last%201%7D%3F&f=false 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes Note : last 1 followed by even number of 0 does not mean 0 cannot come before 1. Some example of strings, 01,0100, 101, 10100. Prashant. answered Jul 27, 2016 • selected Apr 11, 2017 by Bikram Prashant. comment Share Follow See all 4 Comments See all 4 4 Comments reply jaiganeshcse94 commented Jul 27, 2016 reply Follow Share i am having one doubt here A = {w| w contains at least one 1 and an even number of 0s follow the last 1}. given here that the W should have at least one 1 i.e, here the minimum string accepted by the language is 001 it has even no of 0 and at least one 1 or the minimum string accepting this language is 1001 0 votes 0 votes jaiganeshcse94 commented Jul 28, 2016 reply Follow Share this DFA accept the string 01 also, so it is not having even no of 0's isn't it reply me please 1 votes 1 votes as1212742 commented Jul 30, 2016 reply Follow Share is this ok 0 votes 0 votes Prashant. commented Apr 11, 2017 reply Follow Share @Bikram plz review. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Regular expression for the language will be 1*(01*01*)*1 Deepthi_ts answered Apr 11, 2017 Deepthi_ts comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes please refer this link: https://books.google.co.in/books?id=LdAAN89TUscC&pg=PA61&lpg=PA61&dq=dfa+for+A+%3D+%7Bw%7C+w+contains+at+least+one+1+and+an+even+number+of+0s+follow+the+last+1%7D?&source=bl&ots=BuG8yhViqa&sig=O8LovjMkcyfAzvax32JJweK6Ifk&hl=en&sa=X&ved=0ahUKEwj0hs_mjZ_TAhUIsY8KHTHwDgYQ6AEIPjAG#v=onepage&q=dfa%20for%20A%20%3D%20%7Bw%7C%20w%20contains%20at%20least%20one%201%20and%20an%20even%20number%20of%200s%20follow%20the%20last%201%7D%3F&f=false jaiganeshcse94 answered Apr 12, 2017 jaiganeshcse94 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes We need minimum 5 states for this . (The verified answer is wrong , it is not accepting 101 or 10100 ) tech_beardo answered Aug 14, 2020 tech_beardo comment Share Follow See all 0 reply Please log in or register to add a comment.