0 votes 0 votes Describe in simple English the language represented by the regular expression r=(1+10)* Theory of Computation regular-expression theory-of-computation + – Devshree Dubey asked Aug 15, 2018 Devshree Dubey 2.2k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Shaik Masthan commented Aug 15, 2018 reply Follow Share can not starts with 0 and no two consecutive 0 0 votes 0 votes Devshree Dubey commented Aug 15, 2018 reply Follow Share Brother suppose we have to do the reverse of the above lang that is derive the RE,then what steps should be followed? 0 votes 0 votes Shaik Masthan commented Aug 15, 2018 reply Follow Share steps:- 1) Draw the DFA of RE which represent L 2) if more than one final states present in your DFA, make one Final states using ∈ transitions 3) interchange the initial state and final state 4) Change the direction of each edge 5) may be it leads to NFA, so convert into DFA 6) obtain the RE from DFA which is your required RE of LR. 1 votes 1 votes Devshree Dubey commented Aug 15, 2018 reply Follow Share @Shaik Masthan,Brother one more thing why have we used a + and not concatenation? 0 votes 0 votes Shaik Masthan commented Aug 15, 2018 reply Follow Share Brother,didn't get your question clearly 0 votes 0 votes Devshree Dubey commented Aug 15, 2018 reply Follow Share @Shaik Masthan,If you see there is a + b/w 1 and 10. This I am asking? 0 votes 0 votes Shaik Masthan commented Aug 15, 2018 reply Follow Share concatenation means should be occur ( order should be preserved ) + means only one of the those occur a.b means first a occur then b occur a+b means either a occur or b occur but not both These operators are use by us.... on the requirement of us only coming to your example (1+10)* can generate 1,11,11 and many more but (1.10)* can not generate those strings, it will generates only 110,110110,110110110,..... only 1 votes 1 votes Devshree Dubey commented Aug 15, 2018 reply Follow Share @Shaik Masthan,This is what I was actually looking for since yesterday. A big Thanks. :) 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes L = language containing all strings over 0,1 except string starting from 0 and containing consecutive 0's manisha11 answered Aug 16, 2018 manisha11 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Starting with 1 and no two consecutive 0's Sumit Singh Chauhan answered Aug 15, 2018 Sumit Singh Chauhan comment Share Follow See all 2 Comments See all 2 2 Comments reply arvin commented Aug 15, 2018 reply Follow Share but what about Ɛ it wont start with 1. but will be generated by the re. 1 votes 1 votes Devshree Dubey commented Aug 15, 2018 reply Follow Share @arvin,Yeah true. 0 votes 0 votes Please log in or register to add a comment.