Question

Consider the following TM’s. Identify the language recognized by these machines?

Consider the following TMs. Identify the language recognized by these machines? 2. 10, R U1,R 0 ,R qHALT

Answer 1

2)

The language recognized is : zero or more 1's followed by (ending with) zero or one 0
L={1^n(0+e)|0<=n}//here e is empty string
explanation:
   on state q0 if 1 comes then it makes it 0,moves head right and stay on same state
   on state q0 if 0 or empty string comes then it makes it 1,moves head right, and moves to halting state