1️⃣ Deterministic finite automata
=== 🏁 Finite state automata with exactly one transition function for every input symbol in E from each state (= max in one state at a time)==
📖 Example:
- Σ = {0,1}
- F = {F0, F1}
graph LR s0 --"0"--> s1 s0 --"1"--> s2 s1 --> qf0 s2 --"0"--> s3 s2 --"1"--> s4 s3 --> qf1 s4 --"0"--> s4 s4 --"1"--> s4
🔗 Links