Napain to Programmer Humor · 2 years agonon-deterministic finite automata being relatableimagemessage-square5fedilinkarrow-up128arrow-down12file-text
arrow-up126arrow-down1imagenon-deterministic finite automata being relatableNapain to Programmer Humor · 2 years agomessage-square5fedilinkfile-text
minus-squareNapainOPlinkfedilinkarrow-up2·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