Question: Create a Turing Machine that reads a string representing a binary number and erases all leading 0's. However, if the string only contains 0's, it

Create a Turing Machine that reads a string representing a binary number and erases all leading 0's. However, if the string only contains 0's, it keeps one 0 (Ex: Input: 0000 Output: 0; Input: 00101 Output 101). You may describe it formally or informally, but 1 will give you 1 bonus points for doing it formal
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
