Abstract
Abstract A Turning Machine Description Language (TMDL) is developed for easy and efficient modeling of Turing machines. TMDL supports formal symbolic representation of Turing machines. The grammar for the language is also provided. Then a fast single-pass complier is developed for TMDL. The scope of code optimization in the complier is examined. An interpreter is used to simulate the exact behavior of the compiled Turning machines. A dynamically allocated and resizable array is used to simulate the infinite tape of a Turing machine. The procedure for simulating composite Turing machines is also explained. In this paper, two sample Turing machines have been designed in TMDL and their simulations are discussed. The TMDL can be extended to model the different variations of the standard Turing machine.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
