非确定的自动机NFA确定化为DFA

1.设有 NFA M=( {0,1,2,3}, {a,b},f,0,{3} )，其中 f(0,a)={0,1}  f(0,b)={0}  f(1,b)={2}  f(2,b)={3}

   画出状态转换矩阵,状态转换图，并说明该NFA识别的是什么样的语言。

状态转换矩阵：

	a	b
0	{0,1}	{0}
1		{2}
2		{3}

状态转换图：

 

 

语言：(a|b)*abb

 

 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------

2.NFA 确定化为 DFA

1.解决多值映射：子集法

1）. 上述练习1的NFA

		a	b
A	0	{0,1}	{0}
B	{0,1}	{0,1}	{0,2}
C	{0,2}	{0,1}	{0,3}
D	{0,3}	{0,1}	{0}

 

2）. P64页练习3 

 

 

 

 --------------------------------------------------------------------------------------------------------------------------------------------------------------

2.解决空弧：对初态和所有新状态求ε－闭包

1）. 发给大家的图2

		0	1	2
X	ε{ABC}	ε(A)={ABC}	ε{B}={BC}	ε{C}={C}
Y	{BC}		ε{B}={BC}	ε{C}={C}
Z	{C}			ε{C}={C}

 

 

 

 

2）.P50图3.6

		a	b
0	ε{0}={1247}	{38}={3671248}	{5}={567124}
1	ε{1234678}	{38}={1234678}	{59}={1245679}
2	ε{124567}	{38}={1234678}	{5}={124567}
3	ε{1245679}	{38}={1234678}	{510}={12456710}
4	ε{12456710}	{38}={1234678}	{5}={124567}