The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
35 views
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
closed with the note: Absard
asked in Theory of Computation by (79 points)
closed by | 35 views
0
Please provide state transition diagram for all the above machines
0
all 3 are regular languages, what exactly is the issue you are facing while drawing TM?

and please correct 3rd option


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

35,485 questions
42,741 answers
121,445 comments
42,135 users