NFAからDFAへの変換

NFAからDFAへの変換
p=1, j=0, states[0]={},
states[1] = {1,4,9,14}
1. c = ‘a’: j = 1 (j = 0: e = {})
e = DFAedge(states[1],’a’)
= { 5,6,8,15 } → p = 2
trans[1, ‘a’] = 2
2. C = ‘b’-’h’, ‘j’-’z’:
e = DFAedge(states[1],c)
= { 5,6,8,15 } → 同じ状態あり
trans[1, c] = 2
3. c = ‘i’:
e = DFAedge(states[1],’i’)
= { 2,5,6,8,15 } → p = 3
trans[1, ’i’] = 3
…