I have a question about the equivalence of different automata. I looked up the similiar questions but sadly none of them are exactly, what I need or am looking for.
I know some of these are equivalent ( or not ) but for which language class pairs does a real inclusion apply?
DFA = NFA ⊋ ? DPDA ≠ PDA ⊋ ? LBA = DTM = NTM
I want to know, if this is correct or not.
Hint:" C is the class of all languages accepted by a C-type machine" - If this is important.
I apologize, if my question isn't in a correct format, therefor forgive me, I am trying to settle in.