This question is to do with Theory of Computation and Complexity

Hello! I am working on a problem and I don't really understand what to do. 
I'm not really sure how to write enumerators. Do I do think using python program which runs my turing machine? 

Or should my turing machine just print the required output on the tape?

Please do not provide the answer to the attached question. I need guidance on how to start/write the enumerator

 

 

For this question, we will say that a
TURING MACHINE has enumerated a string s if s appears on the tape with the
head on the lefturing machineost symbol, the rest of the TURING MACHINE
empty, and the TURING MACHINE
in special state q_y. For those familiar with Python, q_y is for yield.
Make sure both a and b run on the two-way TURING MACHINE simulator. Hint:
Switch
to 'configuration' mode and then
./turing machine.py q3a.turing machine "" | grep -ie 'q_y'
./turing machine.py q3b.turing machine "" | grep -ie 'q_y'
a) Write down a two-way infinite TURING MACHINE which takes input 0^n and
enumerates
all bit strings of length n. That is, it writes down
000
001
010
011
100
101
110
111
b) Write down a two-way infinite TURING MACHINE which enumerates all bit
strings
epsilon
0
1
00
01
10
11
000
001
010
011
100
101
110
111
.
.
.

Attachments:

• 1493948502-question 1.docx