Register

regular languages closure properties

• retagged by
1,174 views

1 Answer

Best answer
5 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
Voting & Accepting an answer helps improve the community
← Previous · closure property of ...Next → · Made Easy
← Previous in category · closure property of ...Next in category → · turing machine
Position:
Show:

Related questions

0 0 votes
1 1 answer
81
81 views
GO Classes asked Sep 21
81 views
GO Classes DPP | GATE CS | Theory of Computation | Closure Properties
Let $X$ and $Y$ be regular languages. Their symmetric difference is$$X\triangle Y=\{w:w\text{ belongs to exactly one of }X,Y\}$$. Which expression correctly represents $X...
2 2 votes
1 1 answer
113
113 views
GO Classes asked Sep 19
113 views
GO Classes DPP | GATE CS | Theory of Computation | Closure Properties
Let $L_1$ and $L_2$ be regular languages and let $L_3$ be non-regular. Which statements are always true?$L_1=L_2$ iff $L_1\cap\overline{L_2}=\emptyset$ $L_1\cup L_3$ is n...
1 1 vote
1 1 answer
78
78 views
GO Classes asked Sep 19
78 views
GO Classes DPP | GATE CS | Theory of Computation | Closure Properties
Let $L_1$ be regular where specified. Which of the following languages are guaranteed to be regular?$\{ww\mid w\in{0,1}^*\}$ $\{ww\mid w\in L_1\}$ $\{w\mid ww\in L_1\}$ $...
1 1 vote
1 1 answer
90
90 views
GO Classes asked Sep 19
90 views
GO Classes DPP | GATE CS | Theory of Computation | Closure Properties
All languages are over $\{0,1\}$. Which statements are true?If $L_1\subseteq L_2$ and $L_2$ is regular, then $L_1$ must be regular. If $L_1$ and $L_2$ are both non-regula...