retagged by
631 views
1 votes
1 votes
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
retagged by

1 Answer

2 votes
2 votes
(ab*)*
L=(epsilon,a,aa,aaaa,ab,abb,abab,abbbbbbbab,.......)
from outer closure u can get any no of times ab*.....from here u can get any number of b with one a...or even any number of a if we make inner b* as epsilon each time and take outer closure into consideration..

Related questions

1 votes
1 votes
1 answer
1
sushilk asked Jan 25, 2019
1,358 views
if L is any languagethen $((L^*)^+) = ((L^+)^*)$ $?$and $(((L^*)^+)^*) = ?$
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
Devshree Dubey asked Aug 15, 2018
1,078 views
Represent the language over ∑={0,1} containing all possible combinations of 0's and 1's but not having two consecutive 0's.
0 votes
0 votes
2 answers
4
Devshree Dubey asked Aug 15, 2018
2,214 views
Describe in simple English the language represented by the regular expression r=(1+10)*