Give me Turing Machine for the language {w in (a|b|c)* | no of a's > no of b's} ?
ANSWER:
NOTE: Please refer to the attached image for the answer.
NOTE:
1. | q0 is the starting state of the turning machine |
2. | qf is the final state of the turning machine. That means if the string reaches qf, it is accepted by the machine. |
3. | B denotes the blank symbol on the input tape of the turning machine. |
4. | is used for denoting the symbol which has been reviewed by the machine |
5. | a,b and c are the symbols given in the alphabet set. |
6. | L and R denotes the left and right movement of the read/write head in the machine. |
Get Answers For Free
Most questions answered within 1 hours.