Deterministic and Non-deterministic finite automaton
w =
F =
Logic
0
1
> a
a
ab
b
c
ϕ
* c
ϕ
ϕ
0
1
> s1
s2
s1
* s2
s4
s1
* s3
s2
s1
* s4
s4
s1