@[email protected] to Programmer [email protected] • 1 year agonon-deterministic finite automata being relatablelemmy.mlimagemessage-square5fedilinkarrow-up125arrow-down12file-text
arrow-up123arrow-down1imagenon-deterministic finite automata being relatablelemmy.ml@[email protected] to Programmer [email protected] • 1 year agomessage-square5fedilinkfile-text
minus-square@[email protected]OPlinkfedilink2•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