search
Log In
1 vote
1.6k views
regular expression for " set of all strings over {a,b} in which there are at least two occurrences of b between any two occurrences of a ".
in Unknown Category 1.6k views

1 Answer

3 votes
Here is my try:

$b^{*} + b^{*}(abb^{+})^{*}ab^{*}$
0
this is correct..
0

b* + b* (a(bb)+)* ab*

0

the restriction is only on a means if there are 2 a's side by side then there should be 2 b's b/w them rt ?

but if there is no a in the language then there is no restriction on b. So question is how can we generate only b , bb ,bbb...... out of this regular expression ?

from the given RE which is b*+b*(abb+)*ab* how can we get rid-off  this a 

b*+b*(abb+)*ab*

Please tell me is this argument is right or wrong ...I'm so confused with RE 

0
please resolve my comment...
1

yes...b,bb,bb....can be generated...clear ur doubt

assume R.E ====>   A+B  means we can either take A or B at a time but not both...for generating any string..

and     A*  +  B*/////means  we can either take A any no.of time  or B any no.of time but not both...for generating any string..

and   ( A  +  B)*///brackets are important..means  we can either take A any no.of time  or B any no.of time or BOTH...for generating any string..

0

if we write (a,b)^+ or (aUb)^+ or (a+b)^+ does they all mean same ?

0
yes..

Related questions

3 votes
2 answers
1
206 views asked Sep 4, 2017 in Theory of Computation Sunil8860 206 views
2 votes
2 answers
2
678 views
The equality of two regular expression is computed in? Give reasons also.. Constant Time polynomial time logarithmic Polynomial time Exponential time
asked Jul 8, 2016 in Theory of Computation Kapil 678 views
1 vote
2 answers
3
558 views
If r1 and r2 are 2 Regular Expression Such that r1 = (a+b)* r2 = (a*+b*+a*b*+b*a*) What are the different case's in which r1 = r2 ? Please Explain with an example
asked Jun 8, 2016 in Theory of Computation shekhar chauhan 558 views
0 votes
3 answers
4
486 views
Problem 1 : what is the Language associated with this regular expression ? a*b* write it down. Problem 2: Does either a subset or Super-set of a regular language is always a regular ? Problem 3 : What is the difference between a^n b^n and a*b* Explain with a example .
asked Jun 6, 2016 in Theory of Computation shekhar chauhan 486 views
...