Skip to main content
Article thumbnail
Location of Repository

Simulator of Turing Machines Described by Means of Composite Diagrams

By Josef Siska


In this thesis, the theory related to Turing machines and means of their description (with focus on composite diagrams) is presented. The aim of this work is to create an application that allows editing Turing machines described by means of composite diagrams and simulating their computation on specified input configuration (including non-deterministic and multi-tape machines). Furthermore, within the application it will be possible to run the termination analysis of Turing machine in order to determine whether this machine or any of its parts always halt. The resulting application is implemented in Java and the termination analysis is performed using the well-founded orders. And so, one of the results created during this work is a software tool which allows designing and testing of Turing machines described by means of composite diagrams. Resulting application may be used especially during lectures on theoretical computer science, where it can be used to demonstrate computation of some Turing machine

Topics: problém zastavení; well-founded order; halting problem; Turing machine; fundované uspořádání; Turingův stroj; simulace; simulation; kompozitní diagram; composite diagram
Publisher: Vysoké učení technické v Brně. Fakulta informačních technologií
Year: 2014
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.