Professional Documents
Culture Documents
Unit-2 Contents
UNIT-2 Fundamentals of Regular Languages
Introduction to Regular Expressions (RE)
Finite Automata and Regular Expressions
Regular Expressions Applications
Laws of Algebraic for Regular Expressions
The Arden‘s Theorem, Using Arden‘s theorem to construct RE
from FA
Pumping Lemma for RLs
Pumping Lemma Applications
Uniformity of Two FAs
Uniformity of Two REs
Construction of Regular Grammar from RE
Constructing FA from Regular Grammar
Closure properties of RLs, Applications of REs and FAs
2
Introduction to Regular Expressions(RE)
Def:-An expression which is constructed over the alphabet ∑ using the operator
*, . , ε is called Regular Expression(RE).
The RE describes the language accepted by finite state automata.
The basic operations performed on Regular Expressions are Union(3),
Concatenation(2) and Kleen Closure(1).
Union of two RE’s R1 and R2 is a Regular Expression R
Example : If R1=a and R2= b then Union of R1 and R2 is R=a+b
Concatenation of two RE’s R1 and R2 is a Regular Expression R
Example : If R1=a and R2= b then Concatenation of R1 and R2 is R=ab
Iteration(Kleen Closure) of Regular Expression R written as R* is also a regular
expression.
Sample Examples of RE and FA
Regular Expression FA
a
a*
a
q0
a*b
b
q0 q1
(ab)*
a
q0 q1
b
Construction of Regular Expressions