How should I go about showing that the following problem is decidable:
Given DFAs M1 and M2, is L(M1) ⊆ L(M2)?
What is the general strategy to prove that a problem is decidable or undecidable?
Thanks in advance.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community