TURING MACHINE

Question

Comments

Need some clarity On S1.

---

S1.I think by first it means that Turing machine goes only in one direction(Right).As we read input from left to right and machine is not allowed to write on the left side means machine can write in one direction turing machine which makes it One way turing machine and hence same power as FA,making S1 as true.

S2:- True. Can be handled by LBA

S3:- It is used to prove that language is not regular.

Only 2 are true

---

s1 and s2 both are true

Answer 1

https://gateoverflow.in/75866/madeeasy-test-series

Only S3 differ from this question.

Pumping lemma is used as negativity test, i.e, it can only tell us that given language is not regular. 

So S3 should be false.