Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Implementation of Context Free Languages in Universal Turing Machines


Affiliations
1 Sathyabama University, Chennai, India
2 Department of Information Technology, Easwari Engineering College, Chennai, India
     

   Subscribe/Renew Journal


Automata play a major role in compiler design and parsing. 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 platform. 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.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 248

PDF Views: 3




  • Implementation of Context Free Languages in Universal Turing Machines

Abstract Views: 248  |  PDF Views: 3

Authors

A. Maheshwari
Sathyabama University, Chennai, India
M. A. Doraiswamy
Department of Information Technology, Easwari Engineering College, Chennai, India

Abstract


Automata play a major role in compiler design and parsing. 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 platform. 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.



DOI: https://doi.org/10.36039/ciitaas%2F3%2F4%2F2011%2F106984.192-194