Location:
Search - 2q
Search list
Description: 利用VC++6.0对数据库的动态刷新和多表切换-VC 6.0 database update and dynamic multi-table switch
Platform: |
Size: 18242499 |
Author: 远风 |
Hits:
Description: 利用VC++6.0对数据库的动态刷新和多表切换-VC 6.0 database update and dynamic multi-table switch
Platform: |
Size: 18242560 |
Author: 远风 |
Hits:
Description: 【功能提示】
(1) 能实现邮件接收功能、发送功能，以及对用户账号和邮件的管理功能。
(2) 实现用户地址薄的管理功能。（本功能可视进度酌减
Platform: |
Size: 3788800 |
Author: 戚文 |
Hits:
Description: Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2-Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2
Platform: |
Size: 1024 |
Author: Merwyn |
Hits: