Question

Consider the language ins, for example, the words 1, 11 and 11111111, but neither 111 nor 1111111111 1. Prove that L is not context-free. 2. Draw a standard Turing machine with a two-way tape that decides L, using only ?-(L B} as tape alphabet. Very briefly explain how your machine works For every state or group of related states, your explanation should say in a few words (e.g. move back to start of tape" or "replace every blank by 1") what its purpose is in deciding L. You may annotate your machine drawing with these explanations (in a clean and under- standable way), or write a brief text below your machine drawing.

Answer 1

Here in iven diagram shows the state that accepting the given language.

for( bee レー, 1 L 1111m2 0 Stuat Seamd step

2 is the accepting state.