I think I understand the theoretical definition of decidable and undecidable languages but I am struggling with their examples.
A(DFA) = {(M, w): M is a deterministic finite automaton that accepts the string w}
A(TM) = {(M, w): M is a turing machine that accepts the string w}
I know that A(DFA) is decidable and A(TM) is not. But, is A(DFA) a subset of A(TM)?