Milan Metelko (2011) Simulator of the nondeterministic Turing machine. EngD thesis.
The diploma work presents the Turing machine, its use and functionality. The Turing machine is not actually a physical machine, that’s why we added a few examples of its use in practice. The more complex the case, the more time we needed to solve it. If we had a computer programme, the calculating time would be reduced drastically. And that is exactly what we did. We have created a graphical user interface (GUI) which simulates the actions of the Turing machine. The instructions for the machine are written in the input file, they are followed by the simulation of the machine. At the end the application displays the simulation sequence step by step. Thus we do not need to calculate by hand. Further on the structure of the application and the deeper methods that are hidden in the background of the programme are explained. The programme simulates six types of Turing machines, including the deterministic (DTM) and nondeterministic (NTM) Turing machines, all simulated in their own special ways.
Actions (login required)