Open Access Open Access  Restricted Access Subscription or Fee Access

Universal Turing Machine Implementation

A. Maheshwari, M.A. Dorai Rangaswamy

Abstract


Turing Machines are the most powerful computational machines. Turing machines are equivalent to algorithms, and are the theoretical basis for modern computers. Still it is a tedious task to create and maintain Turing Machines for all the problems. The Universal Turing Machine (UTM) or simply a universal machine is a solution to this problem. A UTM simulates any other TM, thus providing a single model and solution for all the computational problems. The creation of UTM is very tedious because of the underlying complexities. Also many of the existing tools do not support the creation of UTM which makes the task very difficult to accomplish. Hence a Universal Turing Machine is developed for the JFLAP latform. JFLAP is most successful and widely used tool for visualizing and simulating all types of automata.

Keywords


CFG, Delta Rule, FSA, PDA, JFLAP, Transitions, UTM

Full Text:

PDF

References


Jonathan Jarvis and Joan M.Lucas, “Understanding the Universal Turing Machine: An implementation in JFLAP”, ACM Portal Volume 23, Issue 5 , Pages 180-188, 2008.

Eric Gramond and Susan H.Rodger, “Using JFLAP to interact with theorems in automata theory”, ACM Portal Proc. in SIGCSE , Pages 336-340, 1999.

Susan H.Rodger, Eric Wiebe, Kyung Min Lee, Chris Morgan, Kareem Omar and Jonathan Su, “Increasing engagement in automata theory with JFLAP”, ACM Transactions, Pages 403-407, 2009.

Alan Rosen and David Rosen, “The Turing Machine Revisited”, MCon Inc., 2007.

[Online]http://www.jflap.org/tutorial/JFLAP tool and tutorials.

J.Hopcroft, R.Motwani and J.Ullmann, Introduction to Automata Theory, Languages and Computation, 3rd Edition, Addison-Wesley, 2006.

Susan H. Rodger and Thomas W. Finley, JFLAP: An Interactive Formal Languages and Automata Package, ISBN 0763738344 ,Jones & Bartlett Publishers, 2006.

“Implementation of Context free languages in Universal Turing Machines”, in the National Conference on Control, Communication and Information Technology NCCCIT 2010 of SRM Easwari Engineering College on 8th – 10th December 2010.

“Implementation of Context free languages in Universal Turing Machines” in the International Conference on Electronics Computer Technology ICECT 2011, organized by IEEE, Kanyakumari on 8th – 10th April 2011.

“Implementation of Context free languages Using Universal Turing Machines” in the National Conference on Cloud and Scientific Computing organized by Dr.MGR University on 28th March 2011.

“Implementation of Context free languages in Universal Turing Machines” in the International Conference on Smart Technologies for Materials, Communication, Controls, Computing & Energy ICST 2011 organized by VEL TECH University on 5th – 7th January 2011.

A. Maheshwari and Dr.M.A. Doraiswamy, “Implementation of Context Free Languages in Universal Turing Machines” in the CIIT International Journal of Automation and Autonomous System, April 2011. Print: ISSN 0974 – 9659 & Online: ISSN 0974 – 9551.


Refbacks

  • There are currently no refbacks.