Theory of computation: nondeterministic finite automata

NFA and DFA are equavelent. The lembda edge can be replaced by a shortcut.

Daily Logs > Computer Science > Theory of Computation

#Math #Proof Theory #Computer Science #Theory of Computation #Finite Automata #Nondeterministic Finite Automata

http://blog.slray.com/2025/02/04/Theory-of-computation-nondeterministic-finite-automa/

Author

Sirui Ray Li

Posted on

February 4, 2025

Licensed under