2022, Vol. 3, Issue 1, Part A
Analysis and research on turing machines and automata simulator
Author(s): Siddharth M
Abstract: A Turing machine is a model that computes mathematically on machines with dedicated symbols according to a set of rules enlisted in a table. Inspite of being a simple model, a Turing machine can be constructed in such a way that it can decode the algorithm behind it and perform the act of simulation. Its working helps in the learning of computational models. This is further established by showing how it could be used to analyse functions in the case of modern computers. Here the endeavor aims to make the learner easily build, modify a Turing machine and visualize the machine’s actions. Finite state automata represent a mathematical model for many devices. Automata has many applications in multiple devices. In software designing, it can be used right from a basic editing of text to a more complex compiler. In computer related gaming, it can be used to frame quizzes, games and many others. In hardware designing, it can be used in modelling, the functioning of various machines like vending, escalators, playing, cooking of cereals etc. Finite state machines are the basic explanation to a many courses. The pushdown Automata which is a finite automata which can use the uppermost part of the stack to finalize the transition it would take is exemplified. Explanation of Pushdown Automata Simulator and Turing machine Simulator facilitating the visual learning through illustration of automata and performance of necessary operations is performed. The combined contribution of this work with the help of modern technology furthers the experimental evaluation and improves learning. A Directed graph is generally used to represent a Turing Machine. It is majorly used to simulate the universal turing machine as some sort of a device that converts variations in physical quantity to a electrical signal of the Turing machine and it consists of many inputs.
Pages: 13-16 | Views: 580 | Downloads: 192
Download Full Article: Click Here
How to cite this article:
Siddharth M. Analysis and research on turing machines and automata simulator. Int J Res Circuits Devices Syst 2022;3(1):13-16.