Application and Tool for Visualization of Turing Machine for the Three Equal Number  Characters - A Review

Jaspreet Kaur; Gagandeep Singh Bains; Sukhpreet Kaur Gill

Application and Tool for Visualization of Turing Machine for the Three Equal Number Characters - A Review

Jaspreet Kaur, Gagandeep Singh Bains, Sukhpreet Kaur Gill

Abstract

In the early 90’s, mathematicians were tiresome to design an operative computation model headed for solving computation difficulties. Amongst these formalisms, the Turing’s invention is acknowledged by means of a model of algorithm or computation. Turing machine set off application in algorithmic statistics philosophy as well as complexity studies. Turing machine will halt when it accepts the string or halt when problem is undecidable. This article provides a review on techniques and algorithms used to resolve the issues in Turing machines. This review article provides a description about the Turing machine which is a very powerful computational machine. Now popularly modern centuries, simulators used for computer abetted intellect have come to be rife on all heights of tutelage. In this article we will take the recursive enumerable language and simulate it in JFLAP tool. The results have shown that the Turing machine recognize how to be reflected and advanced headed for receive any sort of semantic like regular as well as context free language, in addition the results are checked and visualized in JFLAP

Keywords

Halting State, JFLAP, Recursive Enumerable Grammar, Single-tape, Turing Machine, UTM

Full Text:

PDF

References

Jarvis J, Lucas JM. Understanding the universal Turing machine: an implementation in JFLAP. ACM Portal 2008; 23(5): 180-8.

Rodger SH, Finley TW. JFLAP: an interactive formal languages and automata package. Jones and Bartlett Publishers, Sudbury, MA. 2006.

Nagpal CK. Formal languages and automata theory. 2011.

Martin JC. Introduction to languages and the theory of computation. 3rd Edition. 2003.

Sergeyev YD. Numerical point of view on Calculus for functions assuming finite, infinite and infinitesimal values over finite, infinite and infinitesimal domains. Nonlinear Analysis Series A: Theory, Methods and Applications 2009; 1(12): e1688-707

Pandey AK. An introduction to automata theory and formal languages. 2013.

Sharma C, Shakya R. Computational complexity in language string processing and theory of halting problem in deterministic Turing machine accepting context sensitive language. International Conference on Computing for Sustainable Global Development, New Delhi. 2015.

Rosen A, Rosen D. The Turing machine revisited. 2007. Available from: https://en.wikipedia.org/wiki /Turing_Machine.

Rendell P. Conway's game life Turing machine. 2008.

Pradhan T. Enhancement of Turing machine to universal Turing machine to halt for recursive enumerable language and its JFLAP simulation. International Journal of Hybrid Information Technology 2015; 8(1): 193-202.

Selva Vinagam G, Ezhilarasu P, Prakash J. Application of Turing machine as a string reverser for the three input characters - a review. International Conference on Intelligent Systems and Control, Coimbatore. 2016. DOI: 10.1109/ISCO. 2016.7726890.

Wolfram S. The Mathematica Book. 5th Edition,

Wolfram Media, 2003.

Watson BW. The design and implementation of the FIRE engine: a C++ toolkit for finite automata and Regular expressions. Computing Science Note 94/22, Eindhoven University of Technology, Netherlands. 1994.

Skuliber SS, Crkvenac I. Using interactivity in computer-facilitated learning for efficient comprehension of mathematical abstractions. International Conference on Trends in Communication, Bratislava, Slovak Republic. 2001; 2: 278-61.

Skuliber SS, Milanovic A. Extending the textbook: a distributed tool for learning automata theory fundamentals. International Conference on Electronics, Circuits and Systems, Dubrovnik, Croatia. 2002. DOI: 10.1109/ICECS.2002.1046476.