11-Regular Expression To FA-19!01!2023
11-Regular Expression To FA-19!01!2023
Regular Expressions to
Finite Automata
Dr. S K Somasundaram
Assistant Professor Senior Grade 2
School of Computer Science and Engineering,
Vellore Institute of Technology,
Vellore – 632014
Phone No: +91 9843665115
Mail ID: [email protected]
Location: PRP Block – 218D
Finite Automata and Regular Expression
• Theorem
• Every regular language defined by a regular expression is also defined
by the finite automata
• Every regular language defined by the finite automata is also defined
by the regular expression
• To Prove
L(M) = L(R)
Where L(R) => Language for the regular expression ‘R’
L(M) => Language for some NFA-