Are there problems that are DSPACE(O(1)) complete?
-
05-11-2019 - |
سؤال
I know there are problems that are NL-complete, NP-Complete, PSPACE-complete, etc. Are there problems that are DSPACE(O(1))-complete I.e. NSPACE(O(1))-Complete I.e. Reg-Complete?
Thanks!
لا يوجد حل صحيح
لا تنتمي إلى cs.stackexchange