Finite Automata

Finite Automata+ ADD

tk's Amazing FA
States: {q0,q1,q2} - Symbols: {0,1}
NFAStart state: q0Final states: {q2}
Demo FA
States: {q0,q1,q2,q3} - Symbols: {a,b,c,ε}
NFAStart state: q0Final states: {q3}
Ending of Strings ("101")
States: {A,B,C,D} - Symbols: {0,1}
NFAStart state: AFinal states: {D}
Epsolon String Test
States: {q1,q2,q3} - Symbols: {a,b,c,ε}
NFAStart state: q1Final states: {q1,q2,q3}
Double Symbols (accept "00" or "11")
States: {a,b,c,d} - Symbols: {0,1}
NFAStart state: aFinal states: {d}
0 as last digit or contains only 1's (010110,11111)
States: {A,B,C,D} - Symbols: {0,1,ε}
NFAStart state: BFinal states: {A,D}
blah blah
States: {q0,q1,q2,q3,q4,q5,q6,q7} - Symbols: {a,b}
DFAStart state: q0Final states: {q2}
test
States: {a,b,c,d} - Symbols: {q,r,t}
NFAStart state: aFinal states: {b,d}
hello world
States: {q0,q1,q2,q3,q4} - Symbols: {a,b}
DFAStart state: q0Final states: {q3,q4}
NFA(over{0,1}second last of 1)
States: {q0,q1,q2} - Symbols: {0,1}
NFAStart state: q0Final states: {q2}
Try minimize DFA
States: {q0,q1,q2} - Symbols: {a,b,c}
DFAStart state: q0Final states: {q2}
Circular FA
States: {q1,q2,q3} - Symbols: {a,b,c,d}
DFAStart state: q1Final states: {q3}
NFA for a* + (ab)*
States: {q0,q1,q2,q3,q4} - Symbols: {a,b,ε}
NFAStart state: q0Final states: {q1,q4}
Demo FA 2
States: {q1,q2,q3} - Symbols: {a,b,c}
NFAStart state: q1Final states: {q3}
0's = ODD or 1's%3 != 0
States: {q0,q1,q2,q3,q4} - Symbols: {0,1}
NFAStart state: q0Final states: {q2,q4}