Practice Question #2

Question

A is given a four counter machines M1 accepting a language L1, a pushdown tape machine M2 accepting a language L2 and a TM M3 which cannot have more than 10 states and accepting a language L3.

Choose correct statement,

1) The halting problem for M1, M2 and M3 are always decidable.

2) It is decidable if L1 = L2 = L3.

3) It is decidable if L1 = L2 = L3 = ∑*

4) M3 can simulate any TM.

Answer 1

Is the answer option "a"?

Comments

@Ashwin i think option 4

and why do u think its A plz explain