๐ข Non-deterministic finite automata
= ๐ Finite state automata with 0 or more transition functions in the same state for the same symbol (= multiple states at a time)
Methods
๐ Example:
- ฮฃ = {0,1}
- F = {F0, F1}
graph LR
s0 --"0"--> s1
s0 --"0"--> s3
s0 --"1"--> s2
s1 --> qf0
s2 --"0"--> s3
s2 --"1"--> s4
s3 --> qf1
๐ Links