The Gateway to Computer Science Excellence
0 votes
Describe in simple English the language represented by the regular expression r=(1+10)*
in Theory of Computation by Boss (13.8k points) | 91 views
can not starts with 0 and no two consecutive 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) 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.

@Shaik Masthan,Brother one more thing why have we used a + and not concatenation?
Brother,didn't get your question clearly
@Shaik Masthan,If you see there is a + b/w 1 and 10. This I am asking?
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
@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
by Active (2.3k points)
+1 vote
Starting with 1 and no two consecutive 0's
by Active (1.6k points)
but what about Ɛ it wont start with 1. but will be generated by the re.
@arvin,Yeah true.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,258 answers
104,737 users