Professional Documents
Culture Documents
Lecture 11
Faryal Shamsi
Lecturer Computer Science
1. regular expression or
2. finite automaton or
3. transition graph
1. Part 1 – Every language that can be defined by a finite automaton can also
be defined by a transition graph.
2. Part 2 – Every language that can be defined by a transition graph can also
be defined by a regular expression.
3. Part 3 – Every language that can be defined by a regular expression can also
be defined by a finite automaton. When we have proven these three parts,
we have finished our theorem.
Proof – Part 1 ( FA TG)
• Done
Proof – Part 2 ( TG RE)
• Step. 2 – Replace more than one incoming edges to any state with
single edge
Step. 2 – Replace more than one incoming edges to any state with single edge
Proof – Part 2 ( TG RE)
• Step. 4 – If there are more than one edges between initial start state
and final state make is one. (by using Union operation on regular
expressions)
Let’s see an example
State Elimination
Another example
Another example
Another example
Another example
TG for EVEN-EVEN
DFA for EVEN-EVEN
a
q1 q2
a
b b b
b
a
q3
q4
a
RE for EVEN-EVEN
Z2 + Z4 Z5 + Z8 + Z11 + Z4
Z3 Z6 Z1 Z9 + Z11 Z1
+ Z4 + Z7 + Z8 Z10 + Z12 Z5
Z5 Z9 Z10 + Z11 + Z8 + Z7
Z6 + Z8 Z10 + Z12 + Z7 Z3
Concatenation – r1.r2
Concatenation – r1.r2
Example – r1.r2
Resultant FA
Closure – r1*
r = a* + aa*b r* = (a* + aa*b)*
=?