0 votes 0 votes closed with the note: Absard Design a TM that accepts strings over the alphabet{a,b} i)Of even length ii)containing the substring "abababa" iii)not containing two consecutive zeros Theory of Computation turing-machine + – Sourav_35 asked Apr 28, 2018 • closed Apr 29, 2018 by Sourav_35 Sourav_35 283 views comment Share Follow See all 2 Comments See all 2 2 Comments reply Sourav_35 commented Apr 28, 2018 reply Follow Share Please provide state transition diagram for all the above machines 0 votes 0 votes Mk Utkarsh commented Apr 28, 2018 reply Follow Share all 3 are regular languages, what exactly is the issue you are facing while drawing TM? and please correct 3rd option 0 votes 0 votes Please log in or register to add a comment.