Professional Documents
Culture Documents
to an equivalent NFA
a Equivalent NFA
a b
b
Fall 2005 Costas Busch - RPI 3
In General
NFA
Equivalent NFA
Single
accepting
state
Fall 2005 Costas Busch - RPI 4
Extreme Case
Union: L1 L2
Concatenation: L1L2
Star: L1 * Are regular
Languages
Reversal: R
L1
Complement: L1
Intersection: L1 L2
Fall 2005 Costas Busch - RPI 7
We say: Regular languages are closed under
Union: L1 L2
Concatenation: L1L2
Star: L1 *
Reversal: R
L1
Complement: L1
Intersection: L1 L2
Fall 2005 Costas Busch - RPI 8
Regular language L1 Regular language L2
L M1 L1 L M 2 L2
NFA M1 NFA M2
M2
a
L2 ba b
M2
L2 {ba}
b a
Fall 2005 Costas Busch - RPI 12
Concatenation
M1 M2
n n
NFA for L1L2 {a b}{ba} {a bba}
n
L1 {a b}
a L2 {ba}
b b a
Fall 2005 Costas Busch - RPI 15
Example
n
NFA for L1* {a b} *
n
L1 {a b}
a
b
Fall 2005 Costas Busch - RPI 16
Reverse
R
NFA for L1
L1 M1 M1
M1
a
R n
L1 {ba } b
L1 M1 L1 M1
M1
n a a, b
L1 {a, b} * {a b}
b a, b
L1 regular
We show L1 L2
L2 regular regular
L1 , L2 regular
L1 , L2 regular
L1 L2 regular
L1 L2 regular
L1 L2 regular
Fall 2005 Costas Busch - RPI 22
Example
n
L1 {a b} regular
L1 L2 {ab}
L2 {ab, ba} regular regular
Machine M1 Machine M2
FA for L1 FA for L2
qi , p j
State in M1 State in M2
q1 a q2 p1 a p2
transition transition
FA M
q1, p1 a q2 , p2
New transition
Fall 2005 Costas Busch - RPI 26
FA M1 FA M2
q0 p0
initial state initial state
FA M
q0 , p0
New initial state
Fall 2005 Costas Busch - RPI 27
FA M1 FA M2
qi pj pk
FA M
qi , p j qi , pk
n0 m0
L1 {a b} n m
L2 {ab }
M1 M2
a b
q0 b q1 p0 a p1
a, b b a
q2 p2
a, b a, b
Fall 2005 Costas Busch - RPI 29
Automaton for intersection
n n
L {a b} {ab } {ab}
a, b
q0 , p0 a q0 , p1 b q1, p1 a q2 , p2
b a b a
q1, p2 b q0 , p2 q2 , p1
a b
a, b
Fall 2005 Costas Busch - RPI 30
M simulates in parallel M1 and M 2
M accepts string w if and only if
L ( M ) L ( M1 ) L ( M 2 )