Question 16
Not yet
answered
Marked out of
12.0
Flag question
Consider the following language $L$ over $\Sigma = \{0, 1, 2, \#\}$:
Answer the following three sub-questions:
$L = \{0^i \# 1^{3i} \# 2^{i+1} \mid i \ge 0\}$
1. Construct a Turing machine accepting $L$. Justify your answer, explaining how the TM you constructed will accept words in the language $L$.
[5 marks]
2. Give an accepting run of your TM for the word $0\#111\#22$. [3 marks]
Justify your answer, by explaining how the TM accepts words in your language. [3 marks]
3. Is the language accepted by $M$ regular?
Justify your answer, either by giving an FSA or RE that accepts the same language as $M$, or by giving an intuitive argument (or a full one, if you
have time) explaining why there can be no such FSA or RE. [4 marks]
Notation: recall that we write e.g. $0^i$ for the word consisting of $i$-many 0's.
You can use the textbox below for your answer or/and attach a single pdf file.
