- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# What are the closure properties of Regular languages?

In an automata theory, there are different closure properties for regular languages. They are as follows −

- Union
- Intersection
- concatenation
- Kleene closure
- Complement

Let see one by one with an example

## Union

If L1 and If L2 are two regular languages, their union L1 U L2 will also be regular.

## Example

L1 = {an | n > O} and L2 = {bn | n > O}

L3 = L1 U L2 = {an U bn | n > O} is also regular.

## Intersection

If L1 and If L2 are two regular languages, their intersection L1 ∩ L2 will also be regular.

Example

L1= {am bn | n > 0 and m > O} and

L2= {am bn U bn am | n > 0 and m > O}

L3 = L1 ∩ L2 = {am bn | n > 0 and m > O} are also regular.

## Concatenation

If L1 and If L2 are two regular languages, their concatenation L1.L2 will also be regular.

Example

L1 = {an | n > 0} and L2 = {bn | n > O}

L3 = L1.L2 = {am . bn | m > 0 and n > O} is also regular.

## Kleene Closure

If L1 is a regular language, its Kleene closure L1* will also be regular.

Example

L1 = (a U b )

L1* = (a U b)*

## Complement

If L(G) is a regular language, its complement L'(G) will also be regular. Complement of a language can be found by subtracting strings which are in L(G) from all possible strings.

Example

L(G) = {an | n > 3} L'(G) = {an | n <= 3}

**Note** − Two regular expressions are equivalent, if languages generated by them are the same. For example, (a+b*)* and (a+b)* generate the same language. Every string which is generated by (a+b*)* is also generated by (a+b)* and vice versa.

- Related Questions & Answers
- What are the closure properties for context free language?
- What are the properties of Regular expressions in TOC?
- What are the different computer languages?
- What are different types of DBMS languages?
- Construct the Regular expression for the given languages.
- What are the attributes of programming languages in compiler design?
- What are the restrictions of regular grammar?
- Explain Union and Intersection of Regular languages with CFL
- What are the properties of MySQL user variables?
- What are the Properties of Data Encryption Standard?
- Construct the Regular expression for the given languages by the user.
- Prove the equalities of regular expressions by applying properties?
- What are the different benefits of using programming languages in compiler design?
- What are the properties of array class in C#?
- What are the document properties of IE4 DOM method?