Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Hello, I need help with this exercise please: Write the transition table for the Turing machine. Organise the transitions by state or by the order

Hello, I need help with this exercise please:
Write the transition table for the Turing machine.
Organise the transitions by state or by the order they're executed (Section 27.1.3).
Use descriptive state names.
Suggestions: Write and test a machine that handles even-length inputs and then handles odd-length inputs.
'Remove' (i.e. blank out) input symbols as you process them.
You should add tests to check your Turing machine, but you won't be awarded any marks for your tests.
You don't have to remove your tests before submitting this TMA.
In `palindrome_tests`, set the debug parameter to`True`if you want to see
the configurations your Turing machine goes through.
Make sure you**set it back to`False`and run the cell again** before submittingyour
TMA.
############
Here is the code
from m269_tm import run_TM ##### This class is at the bottom
RIGHT =1
LEFT =-1
STAY =0
palindrome ={
# write the transitions here in the form
# (state, symbol): (new_symbol, LEFT or RIGHT or STAY, new_state),
}
palindrome_tests =[
# case, TM, input tape, debug, output tape
('palindrome', palindrome, [1,0,1], True, [1]),
('not palindrome', palindrome, [1,0], True, [0]),
]
test(run_TM, palindrome_tests)
########################
THIS IS THE run_TM class:
RIGHT =1
LEFT =-1
STAY =0
MAX_STEPS =100
def run_TM(tm:dict, tape:list, debug:bool)-> list:
"""Run Turing machine `tm` on `tape` and return the resulting output.
The machine runs from state 'start' until it halts or has done MAX_STEPS.
The output is the tape's content from the head onwards.
If debug is True, print each configuration.
Preconditions:
- tm maps (state, symbol) pairs to (symbol, movement, state) triples
- states are represented by strings
- symbols are of any hashable type
- movement is one of RIGHT, LEFT, STAY
- tape is a list of symbols
- the blank symbol is represented as None
"""
head =0
if tape ==[]:
tape =[None]
symbol = tape[head]
state = 'start'
step =0
if debug:
print(step, state, tape[:head], symbol, tape[head+1:])
while step < MAX_STEPS and (state, symbol) in tm:
actions = tm[(state, symbol)]
tape[head]= actions[0] # write symbol (may be the same)
head = head + actions[1] # move left, right or stay
state = actions[2] # next state (may be the same)
step = step +1
if head <0:
print('Moved left past the start of the tape')
head =0
step = MAX_STEPS # force loop to finish
elif head == len(tape):
tape.append(None) # extend tape when needed
symbol = tape[head]
if debug:
print(step, state, tape[:head], symbol, tape[head+1:])
output = tape[head:]
while output !=[] and output[-1]== None:
output.pop()
return output

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Probabilistic Databases

Authors: Dan Suciu, Dan Olteanu, Christopher Re, Christoph Koch

1st Edition

3031007514, 978-3031007514

More Books

Students also viewed these Databases questions

Question

News Story 16: More on TV Violence.

Answered: 1 week ago