Give an informal description of a deterministic Turing machi

Give an informal description of a deterministic Turing machine for the language L-

Solution

1) Place the tape marker on the left most shell

2) Mark the symbol w and note that if it is 0 or 1

3) If the next mark symbol is not 0, reject

4) Otherwise, mark w(new) and match with the old w stored, if the value matches, accept else reject

5) Continue the procedure

Shortest two strings are 000 and 101