idk

by
Uncategorized

 Let ????????????????????????DFA = {〈????〉 | ???? is a DFA and for every ???? ∈ ????(????), ???? = ???????? where ???? = ????}. Show that ????????????????????????
DFA is decidable.

Tags: No tags