@[email protected] to Programmer [email protected] • 2 years agonon-deterministic finite automata being relatablelemmy.mlimagemessage-square4fedilinkarrow-up116arrow-down11file-text
arrow-up115arrow-down1imagenon-deterministic finite automata being relatablelemmy.ml@[email protected] to Programmer [email protected] • 2 years agomessage-square4fedilinkfile-text
minus-square@[email protected]OPlinkfedilink1•2 years ago“This problem is log-space-reducible to the reachability problem.” xD
“This problem is log-space-reducible to the reachability problem.” xD