Decidable Problem

Question

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.

related: https://cs.stackexchange.com/questions/12267/algorithm-to-determine-whether-two-regexes-are-equivalent/12286#12286 — Ran G., May 12 '15 at 00:53

score 1 · Answer 1 · answered May 12 '15 at 00:58

It is decidable.

First, deciding whether the language of a DFA is empty or not is decidable (by checking if there is a path from the initial state to an accepting state).

Next, a hint:

construct a DFA that accept all the words accepted by M1 that are not accepted by M2.

Decidable Problem

1 Answers1