search
Log In
0 votes
138 views
Describe in simple English the language represented by the regular expression r=(1+10)*
in Theory of Computation 138 views
0
can not starts with 0 and no two consecutive 0
0
Brother suppose we have to do the reverse of the above lang that is derive the RE,then what steps should be followed?
1

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.

0
@Shaik Masthan,Brother one more thing why have we used a + and not concatenation?
0
Brother,didn't get your question clearly
0
@Shaik Masthan,If you see there is a + b/w 1 and 10. This I am asking?
1
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
0
@Shaik Masthan,This is what I was actually looking for since yesterday. A big Thanks. :)

2 Answers

2 votes
L =  language containing all strings over 0,1 except string starting from 0 and containing consecutive 0's
1 vote
Starting with 1 and no two consecutive 0's
1
but what about Ɛ it wont start with 1. but will be generated by the re.
0
@arvin,Yeah true.

Related questions

0 votes
0 answers
1
163 views
Represent the language over ∑={0,1} containing all possible combinations of 0's and 1's but not having two consecutive 0's.
asked Aug 15, 2018 in Theory of Computation Devshree Dubey 163 views
0 votes
0 answers
2
111 views
The correct regular expression for the below mentioned Finite Automata Do we have to have ca* as C is dead state,does dead state be a part of regular expression? The expression I am gettting is c*a(d*+ba*) as C state is dead state hence no need to consider it.Please Correct me.
asked Nov 6, 2018 in Theory of Computation sripo 111 views
1 vote
1 answer
3
457 views
For even no a's RE over {a,b} 1) (b*ab*ab*)* + b* 2) (b*ab*ab*)*.b* 3) both are equal? which one is correct?
asked Aug 14, 2017 in Theory of Computation dyadav335 457 views
1 vote
1 answer
4
284 views
Hi Experts, Can anyone please tell me the strings present in regular expression (ab*)* My doubt is whether (ab*)* can have any combination of the strings in RE ab* like in the following language. L={a,ab,abb}* = {aab,aabb,abba,ababb,..} Here abba is obtained by combining abb and a. Please tell me whether my understanding is right. Thanks in advance, VIshnu
asked Oct 22, 2016 in Theory of Computation Vishnu_2017 284 views
...