L= {0^n#0^2n#0^3n | where n is greater than equall to 1}
L= {0^n#0^2n#0^3n | where n is greater than equall to 1}
Embedded Files
The proof of the language is given above. Before seeing how our machine works, lets take a look how does palindrome turing machine works according to the state diagram:
This machine will work in the following manner:
- Accept all string where exist two delimiter "#", and number of 0's after first # will be double and similarly it should be tripple after second #.
- Otherwise rejected.
Let's take an example:
0n #02n#03n
if n= 1, then we have 0#00#000
As mentioned above the user will enter the following string and press enter button. The input field is restricted and only 0 and # will be written on the input field as input.
Tape will be displayed and states and operations are shown at the left side of the screen.
Finally, the string is accepted by the machine. Whenever, the string is accepted. the start button turn green and green particles will be shown on the screen. We also added sound when string is accepted.
Now let see, what happens when a string is rejected:
Suppose, user enters a string 0#00 and press enter.
User will move tape and see either it is our language or not by pressing space bar. The states and operations will be displayed.
The string is rejected. The start button turns red with "string rejected" sound and red particles will be shown on the screen.
For further details, visit https://www.youtube.com/watch?v=k7vEHJ9RhE4 for complete binary palindrome tutorial.
Page updated
Google Sites
Report abuse