Napain@lemmy.ml to Programmer Humor@lemmy.ml · 2 years agonon-deterministic finite automata being relatablelemmy.mlimagemessage-square4fedilinkarrow-up121arrow-down11file-text
arrow-up120arrow-down1imagenon-deterministic finite automata being relatablelemmy.mlNapain@lemmy.ml to Programmer Humor@lemmy.ml · 2 years agomessage-square4fedilinkfile-text
minus-squareNapain@lemmy.mlOPlinkfedilinkarrow-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