0 votes 0 votes Give regular expression for all strings over {0,1) not ending in 01. Theory of Computation theory-of-computation regular-expression + – Ayush Upadhyaya asked Mar 9, 2017 Ayush Upadhyaya 536 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes S->0|1| ε|A A->0A|1A|00|10|11 This is the regular grammar. From the above idea it is possible to construct the regular expression. ε+0+1+(0+1)* (00+10+11) balaeinstein answered Mar 31, 2017 edited Jun 25, 2017 by balaeinstein balaeinstein comment Share Follow See 1 comment See all 1 1 comment reply Vishal Goyal commented Jun 22, 2017 reply Follow Share (0+1)* (00+10+11) is enough in i think and doenot end with 01 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes regular expression is not unique may be something else given in ans but all will generate same lang 2018 answered Mar 9, 2017 2018 comment Share Follow See all 3 Comments See all 3 3 Comments reply Shivam Bhardwaj commented Jun 4, 2017 reply Follow Share your answer doesn't contain the empty (^) string. 1 votes 1 votes Udit Gupta 1 commented Sep 21, 2017 reply Follow Share I think the correct RE will be : (1 + 0((0+10)* + 11))* 0 votes 0 votes LeenSharma commented Sep 21, 2017 reply Follow Share Udit Gupta 1 but your RE accepting 01 Right? 0 votes 0 votes Please log in or register to add a comment.