Closure Properties of Regular Language Lecture-2
Closure Properties of Regular Language Lecture-2
Closure Properties of Regular Language Lecture-2
Language
Regular Language
A language that can be defined by regular
expression.
L1 = { bb abb aabb aaabb …..}
RE = a*bb
q0 q1 q2
q0 q1
Closure Properties of Regular Language
LI U L2 = L10
New States
State a b
(P,1) +-A (Q,2) D (P,1) A
(P,2) +B (Q,1) C (P,2) B
(Q,1) +C (R,2) F (P,1) A
(Q,2) +D (R,1) E (P,2) B
(R,1) E (R,2) F (R,1) E
(R,2) +F (R,1) E (R,2) F
Union of FAs
Closure Properties of Regular
Language(Complement)
If L is a language over the alphabet ∑, then
its complement denoted by L’ is a language
consisting of all string from ∑(ab)* that are
not words in L
L’ = {x ∈ ∑* | x ∉ L}
L1 = { a, ab, aa, abb, aaa, aba, … }
L1’ = ∑* - L1 = {^, b, ba, bb, bab, baa …}
If L is a regular Language, then L’ is also a
regular language. i.e. the set of regular
language is closed under complementation.
Closure Properties of Regular
Language(Complement)
If L is a regular language then Kleen’s theorem states that
there is some FA that accepts the language L.
This FA contains some final states. Reverse the final status
of each state, means convert final to no-nfinal state and
no-final to final state.
This new FA will now accept all the string that were
previously being rejected and reject all the previously
accepted strings i.e it accepts the words of L’.
Thus this new FA defines L’ which by Kleen’s theorem
indicates that L’ can also be defined by a Regular
Expression and hence is a Regular Language.
Closure Properties of Regular
Language(Complement)
Example L = {abb, aba}
L’ = {^, a, b, ab, ba, bb, aa … aaa, baa .. }
- + -
+ +
+
+
Closure Properties of Regular
Language(Intersection)
If L and M be languages over alphabet ∑. Then
L ∩ M is the language that contains all string
that are in both L and M.