Scribd
Upload
11 views5 pages

FA - 10-1 - Closure Properties of Regular Languages

The document outlines the closure properties of regular languages, stating that operations such as union, concatenation, complement, intersection, difference, reversal, and homomorphism result in regular languages. It also discusses the process of finding the complement of a regular language using a DFA and provides examples for intersection and difference of regular languages. Additionally, it addresses decidability questions regarding language emptiness and equivalence between languages.

Uploaded by

khizerch114165
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views5 pages

FA - 10-1 - Closure Properties of Regular Languages

The document outlines the closure properties of regular languages, stating that operations such as union, concatenation, complement, intersection, difference, reversal, and homomorphism result in regular languages. It also discusses the process of finding the complement of a regular language using a DFA and provides examples for intersection and difference of regular languages. Additionally, it addresses decidability questions regarding language emptiness and equivalence between languages.

Uploaded by

khizerch114165
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Closure Properties of Regular Languages:

 The union of two regular languages is regular.


 The concatenation of regular languages is regular.
 The closure (star) of a regular language is regular.
 The complement of a regular language is regular.
 The intersection of two regular languages is regular.
 The difference of two regular languages is regular.
 The reversal of a regular language is regular.
 The closure (star) of a regular language is regular.
 A homomorphism (substitution of strings for symbols) of a regular language is regular.
 The inverse homomorphism of a regular language is regular.

The complement of a regular language is regular:

Let us consider Language L with the following DFA:

What will be its complement L’?

 Change all original final states to non-final.


 Change all original non-final states to final.

Task: What is the RE of this DFA?


The intersection of two regular languages is regular

Consider RE for L1: (a + b)*aa(a + b)*


Consider RE for L2: b*(ab*ab*)*

What will be the RE for L1 ∩ L2?

A ∩ B = (A’ U B’)’

(A’ U B’)’ = (A’)’ ∩ (B’)’ = A ∩ B

Step 1: A’
Step 2: B’
Step 3: A’ U B’
Step 4: (A’ U B’)’

DFA1:

DFA2:

Step 1: DFA1’:

Step 2: DFA2’:
Step 3: DFA1’ ∪ DFA2’:

Step 4 – (DFA1’ ∪ DFA2’)’ = DFA1 ∩ DFA2 :

Finding out the RE for L1 ∩ L2

Step 1: Bypassing z2 and z6


Step 2: Bypassing z3
Step 3: Bypassing z4
The difference of two regular languages is regular:

If L and M are regular languages then L-M is also a regular language.

Proof:

 We know that
o If M is regular language then M’ is also regular
o If L and M are regular languages then L ∩ M is also regular
 Because L – M = L ∩ M’, so L – M is also regular.

Task: Implement this on DFA for the language accepting strings containing aa.

Decidability:

1. Is this language empty?


2. Is the string w in the language?
3. Are the languages equivalent?

Q1. Is this language empty?

RE: (a+λ)(ab*+ba*)(λ+b*)*

Step 1: Remove all *


Step 2: Remove all + and its right side

Applying step 1 on the RE: (a+λ)(ab+ba)(λ+b)

Applying step 2 on the RE: (a)(ab)(λ)


= aabλ
= aab …........... The language accepts aab at least !!!

So, The language is not empty.

Note:
o aλ = a
o λa = a
o aλb = ab
o bλa = ba
Q3. Are the languages equivalent?
L1 and L2 are not equivalent because
L1 = {2,3,4,5}
- although all members L1 are in L2,
L2 = {2,3,4,5,6} - but all members of L2 are not in L1.

L1 ∩ L2 = {} …… Does it mean that they are equivalent?


L1 = {1,2,3}
L2 = {6,7,8} …… L1 ∩ L2 = {} … They are NOT equivalent?

If (L1 ∩ L2’) + (L1’ ∩ L2) = {} then it means both languages are equivalent !!!

U = {1,2,3,4,5}
L1 = {1,2,3} L1’ = {4,5}
L2 = {1,2,3} L2’ = {4,5}
L1 ∩ L2’ = {} L1’ ∩ L2 = {}

(L1 ∩ L2’) ∪ (L1’ ∩ L2) = {} ………… Both languages are equivalent

You might also like