Consider the language SUBSET-DFA={⟨M1,M2⟩|L(M1)⊆L(M2)} . Show that SUBSETDFA is decidable.
1
-
$\begingroup$ We discourage posts that are the statement of an exercise-style task. We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in improving your question. This site is a place where people can collaborate to build an archive of knowledge, in the form of high-quality questions and answers that are likely to be useful to others in the future. $\endgroup$– D.W. ♦Commented Nov 12 at 23:03
Add a comment
|