4 votes 4 votes Theory of Computation theory-of-computation regular-expression + – shekhar chauhan asked Apr 19, 2016 shekhar chauhan 3.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Since (0+1)(0+1)*=(0+1)+ => ((0+1)+)*=(0+1)* Therefore resulting grammar will be like below (0+1)*00(0+1)*=====> Contains atleast two consecutive zeros Paras Nath answered Dec 26, 2016 Paras Nath comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes it same as writing (0+1)*00(0+1)* L contains strings with atleast 2 zeroes Sanket_ answered Apr 20, 2016 Sanket_ comment Share Follow See all 2 Comments See all 2 2 Comments reply papesh commented Apr 24, 2016 reply Follow Share Language having at least 2 consecutive zeroes. 0 votes 0 votes Dexter commented Apr 25, 2016 reply Follow Share No atleast 2 zeroes can be 010 also ryt ? But the answer should be string containing 2 zeroes 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes This RE represents a language containing 00 as a substring jerry answered May 4, 2016 jerry comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L=( (0 + 1) (0 + 1)*)* 00 (0 + 1)* L has all substring with atleast two zeros srestha answered Apr 19, 2016 srestha comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments rajan commented Apr 21, 2016 reply Follow Share can we say sir cantaining substring 00 2 votes 2 votes Praveen Saini commented Apr 21, 2016 reply Follow Share yes, all strings containing 00 as substring. 3 votes 3 votes srestha commented Apr 21, 2016 reply Follow Share yes all substring with atleast two consecutive zeros .rt? 0 votes 0 votes Please log in or register to add a comment.