Poznámky
Osnova
Part IV.
Variants of Finite Automata
Theory vs. Practice
Use of FA in General
From FA to DFA in Essence 1/2
From FA to DFA in Essence 2/2
Theorem
e
-closure
Algorithm:
e
-closure
e
-closure: Example
Algorithm: FA to
e
-free FA
FA to
e
-free FA: Example 1/3
FA to
e
-free FA: Example 2/3
FA to
e
-free FA: Example 3/3
Algorithm:
e
-free FA to DFA 1/2
Algorithm:
e
-free FA to DFA 2/2
e
-free FA to DFA: Example 1/5
e
-free FA to DFA: Example 2/5
e
-free FA to DFA: Example 3/5
e
-free FA to DFA: Example 4/5
e
-free FA to DFA: Example 5/5
Accessible States
Previous Example
Algorithm II:
e
-free FA to DFA 1/2
Algorithm II:
e
-free FA to DFA 2/2
e
-free FA to DFA: Example 1/3
e
-free FA to DFA: Example 2/3
e
-free FA to DFA: Example 3/3
Terminating States
Algorithm: Removal of nont. states
Nonterminating States: Example
Summary: States to Remove
Complete DFA
Algorithm: DFA to Complete DFA
Well-Specified FA
Algorithm: FA to WSFA
Distinguishable States
Distinguishable States: Example
Minimum-State FA
Algorithm: WSFA to Min-State FA
Minimization: Example 1/4
Minimization: Example 2/4
Minimization: Example 3/4
Minimization: Example 4/4
Variants of FA: Summary