?/p>
?/p>
?/p>
?/p>
?/p>
?/p>
?/p>
1
.构造下列正规式相应?/p>
DFA
?/p>
(1)
1(0|1)
*
101
(2)
1(1010
*
|1(010)
*
1)
*
0
(3)
a((a|b)
*
|ab
*
a)
*
b
(4)
b((ab)
*
|bb)
*
ab
解:
(1)1(0|1)
*
101
对应?/p>
NFA
?/p>
?
表由子集?/p>
?/p>
NFA
转换?
DFA
?/p>
I
I
0
=
ε
-closure(MoveTo(I,0))
I
1
=
ε
-closure(MoveTo(I,1))
A[0]
B[1]
B[1]
B[1]
C[1,2]
C[1,2]
D[1,3]
C[1,2]
D[1,3]
B[1]
E[1,4]
E[1,4]
B[1]
B[1]
(2)1(1010
*
|1(010)
*
1)
*
0
对应?/p>
NFA
?/p>
0
1
2
3
1
1
0
4
1
1
0
A
B
C
D
1
1
0
E
1
1
0
0
0,1
1