A language L is "star closed" if L = L*. Let SC_DFA = {< M > | M is a DFA that decides a star closed language}. Show that SC_DFA is in P.
P is polynomial time.
Donate. I desperately need donations to survive due to my health
Get paid by answering surveys Click here
Click here to donate
Remote/Work from Home jobs
Comments
Post a Comment