Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Example: (a b c) *
r1 r2
r1 r2
Are regular expressions
r1 *
r1
Fall 2006 Costas Busch - RPI 3
Examples
Example
L
L
La a
Fall 2006 Costas Busch - RPI 6
Definition (continued)
Lr1 * Lr1 *
Lr1 Lr1
Fall 2006 Costas Busch - RPI 7
Example
Regular expression: a b a *
Lr {a b
2n 2m
b : n, m 0}
Regular expression r (0 1) * 00 (0 1) *
Definition:
r1 (1 01) * (0 )
r2 (1* 011*) * (0 ) 1* (0 )
r1 and r2
L(r1) L(r2 ) L
are equivalent
regular expressions
Fall 2006 Costas Busch - RPI 14
Regular Expressions
and
Regular Languages
Languages
Generated by
Regular Expressions
Regular
Languages
Languages
Generated by Regular
Languages
Regular Expressions
Languages
Generated by Regular
Languages
Regular Expressions
Languages
Generated by Regular
Languages
Regular Expressions
regular
L( M 2 ) {} L( )
languages
a
L( M 3 ) {a} L(a)
Suppose
that for regular expressions r1 and r2 ,
L(r1 ) and L(r2 ) are regular languages
Lr1 r2
Are regular
Languages
Lr1 *
Lr1
Fall 2006 Costas Busch - RPI 21
By definition of regular expressions:
Lr1 * Lr1 *
Lr1 Lr1
Fall 2006 Costas Busch - RPI 22
By inductive hypothesis we know:
L(r1 ) and L(r2 ) are regular languages
We also know:
Regular languages are closed under:
Union Lr1 Lr2
Concatenation Lr1 Lr2
Star Lr1 *
Fall 2006 Costas Busch - RPI 23
Therefore:
Are regular
Lr1 r2 Lr1 Lr2
languages
Lr1 * Lr1 *
Example: r r1 r2
L(M1 ) L(r1 )
L(M ) L(r )
L(M2 ) L(r2 )
Languages
Generated by Regular
Languages
Regular Expressions
L( M ) L
Example: Corresponding
M Generalized transition graph
a c a c
a, b ab
Fall 2006 Costas Busch - RPI 28
b b
Another Example:
a
q0 q1 a, b q2
b
Transition labels b b
are regular a
expressions q0 q1 a b q2
b
Fall 2006 Costas Busch - RPI 29
b b
Reducing the states:
a
q0 q1 a b q2
b
Transition labels
are regular bb * a b
expressions
q0 bb * (a b) q2
Fall 2006 Costas Busch - RPI 30
Resulting Regular Expression:
bb * a b
q0 bb * (a b) q2
r (bb * a) * bb * (a b)b *
L( r ) L( M ) L
Fall 2006 Costas Busch - RPI 31
In General
Removing a state: e
d c
qi q qj
a b
ae * d ce * b
ce * d
qi qj
ae * b
Fall 2006 Costas Busch - RPI 32
By repeating the process until
two states are left, the resulting graph is
Initial graph Resulting graph
r1 r4
r3
q0 qf
r2
The resulting regular expression:
r r1 * r2 (r4 r3r1 * r2 ) *
L( r ) L( M ) L
Fall 2006 Costas Busch - RPI
End of Proof-Part 2 33
Standard Representations
of Regular Languages
Regular Languages
DFAs
Regular
NFAs
Expressions