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 -
- A accepts A
- B accepts A
- A accepts B
- B accepts B
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 -
Copyright © 2021 JogjaFile Inc.