Napain@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agonon-deterministic finite automata being relatablelemmy.mlimagemessage-square5fedilinkarrow-up121arrow-down12file-text
arrow-up119arrow-down1imagenon-deterministic finite automata being relatablelemmy.mlNapain@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agomessage-square5fedilinkfile-text
minus-squareNapain@lemmy.mlOPlinkfedilinkarrow-up1·1 year ago“This problem is log-space-reducible to the reachability problem.” xD
“This problem is log-space-reducible to the reachability problem.” xD