Answer Happy

Question 6 1 pts If a language is accepted by a Turing Machine, can you say for certain it is accepted by: I) DFA II) NEA III) LBA IV) PDA V) No. It may not be accepted by NFA or PDA or LBA OI 0 0 OV = > - > OIV