How to prove a turing machine is decidable which accepts ⟨A, B⟩ | A and B are NFAs and L(A) ⊆ L(B).

266 Views Asked by At

So I'm trying to construct a Turing machine M = = {⟨A, B⟩ | A and B are NFAs and L(A) ⊆ L(B)}. I was wondering how to approach this problem as there are total 4 possibilities -

  1. A accepts A
  2. B accepts A
  3. A accepts B
  4. B accepts B