retagged by
789 views

1 Answer

Best answer
5 votes
5 votes

Kleene's closure is nothing but a special case of infinite union of regular language..And the regular language about which Kleens's Closure is about is Σ i.e. if Σ = {a,b} then the regular expression and hence regular language we are focussing on is (a + b)..

So Kleene's Closure for alphabet {a,b} can be written as :

ϵ + (a+b) + (a+b)2 + (a+b)3..................................... which is nothing but (a + b)* which is Kleene's Closure w.r.t alphabet {a,b}..

But this is not necessary that infinite union of any regular language will lead us to regular language as regular languages are not closed under infinite union, subset ,infinite intersection , infinite difference.

But for a language L = (a + b) as described above which is a special case (Kleene's Closure) in that case we are getting regular language (a + b)*..

I hope u have got the difference..

selected by

Related questions

4 votes
4 votes
1 answer
1
anurag sharma asked Dec 24, 2018
1,897 views
What is difference between Σ* and L* ? Which is true ?S1 : Σ* – {ϵ} = Σ+S2 : L* – {ϵ} = L+ .
3 votes
3 votes
1 answer
2
iarnav asked Nov 1, 2017
582 views
If L1 = Regular L and L2 = CFL then L1 UNION L2?= L1 U L2= Reg L U CFL= CFL U CFL= CFL is it True?
1 votes
1 votes
0 answers
3
1 votes
1 votes
0 answers
4
dragonball asked Aug 16, 2017
528 views
Can anyone elaborate the properties of regular language with non regular under union, intersection, set difference , complement etc.