assume =(a, b). Answer each of the following questions considering the following TM. (A,A,R) HALT (AAR)...

 

Transcribed Image Text:

assume Σ=(a, b). Answer each of the following questions considering the following TM. (A,A,R) HALT (AAR) START (a,a,L) (b,b,L) (a.A.R) (b.A.L) (AAL) (b.AL) (a.a.R) (b.b.R) 2.1) Describe in English the language defined by the TM and explain your answer with three example strings. I 2.2) Prove whether the given language is either regular or non-regular. If non-regular, use pumping lemma to prove it is non-regular. 2.3) Build a CFG for the same language and explain with two example strings, one of which is accepted and the other one of which is not accepted. 2.4) Build a PDA for the same language and explain with two example strings, one of which is accepted and the other one of which is not accepted. assume Σ=(a, b). Answer each of the following questions considering the following TM. (A,A,R) HALT (AAR) START (a,a,L) (b,b,L) (a.A.R) (b.A.L) (AAL) (b.AL) (a.a.R) (b.b.R) 2.1) Describe in English the language defined by the TM and explain your answer with three example strings. I 2.2) Prove whether the given language is either regular or non-regular. If non-regular, use pumping lemma to prove it is non-regular. 2.3) Build a CFG for the same language and explain with two example strings, one of which is accepted and the other one of which is not accepted. 2.4) Build a PDA for the same language and explain with two example strings, one of which is accepted and the other one of which is not accepted.