2 2 votes What's is correct answer and how did u find it? Theory of Computation theory-of-computation theory-of-computation + – Harikesh Kumar 941 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Ashwin Kulkarni commented Jan 27, 2018 reply Follow flag The language should have 2 consecutive 0's or 1's anything before and after will be accepted. hence B will be the answer. In your case 0100011101 is not accepted but it will be in the language. Your option gives starting and ending with two consecutive 0's and 1's 0 0 replyShare hs_yadav commented Jan 27, 2018 reply Follow flag harikesh...ur answer is notaccepting string....10011 option B is correct 0 0 replyShare Harikesh Kumar commented Jan 27, 2018 reply Follow flag I know my answer is wrong ....but I want to know how to find correct option? 0 0 replyShare Harikesh Kumar commented Jan 28, 2018 reply Follow flag This is the correct dfa ? If yes then now how I convert it into regular language? Else What is the correct dfa and how to find regular expression? 0 0 replyShare Please log in or register to add a comment.
1 1 vote Is this one correct? If yes plese explain how? Please provide the correct answer Harikesh Kumar answered Jan 28, 2018 Harikesh Kumar comment Share Follow See 1 comment 1 1 comment reply varunraj commented Mar 21, 2018 reply Follow flag Ans: 0 0 replyShare Please log in or register to add a comment.
