Scribd
Upload
44 views13 pages

Closure Properties of Regular Languages

This document discusses closure properties of regular languages and how to prove them using automata theory. It states that regular languages are closed under complement, union, intersection, difference, concatenation, Kleene star, and reversal. It will prove these properties using deterministic finite automata (DFAs) and non-deterministic finite automata (NFAs), showing that the languages recognized by these automata models are equivalent to regular expressions and thus regular languages. Specific closure properties like complement, intersection, and union will be demonstrated using DFAs, while some properties are easier to show with regular expressions.

Uploaded by

Badar Rasheed Butt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
44 views13 pages

Closure Properties of Regular Languages

This document discusses closure properties of regular languages and how to prove them using automata theory. It states that regular languages are closed under complement, union, intersection, difference, concatenation, Kleene star, and reversal. It will prove these properties using deterministic finite automata (DFAs) and non-deterministic finite automata (NFAs), showing that the languages recognized by these automata models are equivalent to regular expressions and thus regular languages. Specific closure properties like complement, intersection, and union will be demonstrated using DFAs, while some properties are easier to show with regular expressions.

Uploaded by

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

Automata Theory

Lecture 7
Before to proceed
• We know languages expressible by regular expressions are called
regular languages.
• We don’t know but we’ll prove later languages recognizable by DFAs
are also regular because all the languages expressible through RegEX
are recognizable by DFAs and languages recognizable by DFAs are
expressible with RegEx.
In other words
RegEx = DFA = Regular languages
Closure properties of regular languages
Regular languages are closed under
• Complement
• Union
• Intersection
• Difference (relative complement)
• Concatenation
• Kleene star
• Reverse or mirror language
How to prove these properties?
• By assuming RegEx = DFA = Regular language

we can use either DFA or RegEx to prove these properties

• Some properties are easy to prove with DFA, some are easy to prove
with RegEx and for some we’ll study a variation of DFA called NFA
which will also be proved equivalent to DFA.
Lets show these properties using DFA’s
Complement of a language using FA
Intersection using DFA
Union using DFA
Difference using DFA
Concatenation using DFA
Kleene star closure using DFA
• On board explanation
• Idea: Concatenating a DFA with itself
Reversal/mirror using DFA
• We’ll show this using NFA later.
Properties easy to show with RegEx
• Union
• Concatenation
• Kleene star closure

You might also like