Question

. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın guage of all palindromes over alphabet {a, b} . Please give both the high-level description (text description or pseudo-code algorithm) and the low-level state transition diagram. Please analyze how many steps (one transition is considered as a step) it takes to accept an input palindrome with n symbols . Please design a deterministic Turing machine with two semi-infinite tapes for the same language. Please give both the high-level description and the low-level state transition diagram. Please analyze how many steps it takes to accept an input palindrome with n symbols. Your machine should accept a palindrome with only O(n) steps, where O is the big O notation. We assume that initially an input string is on the first tape and the second tape is empty. Please use the following transition notation: (a, b) → (c,d). (L. R), which means that if Page 1 of 2 the current symbol on the first tape is a and the current symbol on the second tape is b, then for the first tape we replace a with c and move the tape head to the left, and for the second tape we replace b with d and move the tape head to the right. You may use the stay option, if needed

Answer 1

ins on input State x Replace with f [メis blank symbo IJ (2) Move ฑ์าเ, t till fhe end then move one Lelt. It bu ae in (3) And go back tb the leįt Untill yoaget and move one ซ1 EIse , hali and ject d) tontnue abovepDce untlaand ject to) t all on in put Sting - Stig end าทั้9ht done in step ' Came as ooll xixlR

2 mDves hieh