let sigma={a,b,c}. draw the transition graph of a turing machine(TM) that accepts the language.

L={w(ab)^n : n>=1 , w belongs to sigma^+ and w contains two aand zero or more b and c}.

write the sequence of moves done by the TM when input string isu=acaaba .is the string acceptes?//

Transcribed Image Text:

Question 1 Let Σ = {a, b, c} Draw the transition graph of a Turing Machine (TM) that accepts the language: L = {w(ab)" : n ≥ 1, w € Σ¹ and w contains tu Write the sequence of moves done by the TM when the input string is . Is the string accepted? 10 pts v = acaaba U Question 1 Let Σ = {a, b, c} Draw the transition graph of a Turing Machine (TM) that accepts the language: L = {w(ab)" : n ≥ 1, w € Σ¹ and w contains tu Write the sequence of moves done by the TM when the input string is . Is the string accepted? 10 pts v = acaaba U

Answer rating: 100% (QA)

State diagram ... View the full answer