Given a string from the language L((0+1)*) on the tape, give the program and draw the state
Fantastic news! We've Found the answer you've been seeking!
Question:
Given a string from the language L((0+1)*) on the tape, give the program and draw the state diagram of a Turing Machine that can output on the tape:
- 0: If the number of O's > the number of 1's
- 1: If the number of 1's > the number of 0's
- N: If the number of l's = the number of 0's
Assume null string has an equal number of 0's and 1's. Use the following format for your instructions (5-tuple):
(
Examples:
1. (q 0 0 X R q 0 ): If in state the the symbol on the tape is 0, change it to X and move the head to right and stay on the same state.
2. (q 1 1 _ R q 2 ): If in state q1, the symbol on the tape is 1, erase it and move the head to right and change to state q 2 .
3. (q 3 * 0 * q HALT ): If in state q 3 , the symbol on the tape is not important, just change it to 0 and HALT.
Related Book For
Posted Date: