The aim of this thesis is to create a tool supporting the teaching of Turing machines for the IB110 course.
The tool will build on an existing service for evaluation of finite automata and grammars uses at FI MUNI.
In particular, the tool will allow:

• input of a user-defined Turing machine, either in a graphical form or via a transition table; both interfaces will allow the user to easily edit a machine being work with, analogously to the aforementioned automata tools,
• simulating the computation of a Turing machine on a given input,
• testing the equivalence of a Turing machine to another one (given that the equivalence is generally undecidable, the check will consist of checking the equivalence of the machines on a set of selected or randomly generated words). 

The constructed tool will be available as a web application, connected to the 
ROPOTs (Revision, Opinion Poll and Testing) in the Information System of
Masaryk University. A full deployment of the tool is an optional part of the thesis, to be consulted with maintainers of the existing automata tool. Nonetheless, the code submitted along the thesis should be fully functional and sufficient to fully demonstrate the functionality of the tool.

Vytvořený kód bude veřejně dostupný v ISu pod licencí
MIT.