The image shown above is the main menu or main screen of my project. It displays the palindrome turing machine and the name of group member. By clicking the name, new scene will be loaded. First we'll see what is a turing machine then we'll discuss what is a palindrome turing machine and how does it work.

• Turing Machine: The Turing Machine was invented in 1936 by Alan Turing. A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules. The machine operates on an infinite memory tape divided into discrete "cells". The machine positions its "head" over a cell and "reads" or "scans" the symbol there.

• Palindrome Turing Machine: A palindrome is a string that reads the same forwards as it does backwards. It is a Turing Machine that recognizes palindromes involving only the symbols a and b or 0 and 1. But in our case, the machine accepts only 0 and 1. It is binary palindrome turing machine and it can be even and odd length.

Before seeing how our machine works, lets take a look how does palindrome turing machine works according to the state diagram:

This is our palindrome turing machine screen. Let suppose, the user enters the string 101 and press enter button.

The tape will be displayed on the screen as shown in the above picture. We restricted our tape that only 3 cubes will display on the screen. Now the user can only press space bar to move the tape. By pressing space bar each time the states and operation will be changed according to our Jflap state diagram.

The language is finally accepted by the machine. Machine will accept all strings that fulfills the criteria of binary palindromes. Whenever, the string is accepted, the start button turns into accepted and the button color will be changed into green.

Suppose we enter a string 01, which is not a palindrome.

User will move tape and see either it is a palindrome or not by pressing space bar. The states and operations will be displayed as mentioned above.

Finally, the string is rejected because it was not a palindrome. The start button turns red and rejected is replaced with start at the top right of the screen.