文章基本信息

标题：Enhancement of Turing Machine to Universal Turing Machine to Halt for Recursive Enumerable Language and its JFLAP Simulation
本地全文：下载
作者：Tribikram Pradhan
期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2015
卷号：8
期号：1
页码：193-202
DOI：10.14257/ijhit.2015.8.1.17
出版社：SERSC
摘要：Turing Machines are the most powerful computational machines. Turing machines are similar to algorithms, and are the theoretical basis for real computers. It is a tiresome task to build and maintain Turing Machines for all the problems. The Solution of this problem is The Universal Turing Machine (UTM) or simply a universal machine. The Formation of UTM is very difficult due to the fundamental complexities. There are so many existing tool those does not supporting formation of Universal Turing Machine that's why it is very difficult to accomplish the task. So that JFLAP platform is used for the creation of UTM. JFLAP is wrapping up of graphical tools that are used as an assist in learning basics of formal languages and automata theory. It is software to perform experiment using formal languages topics covered Nondeterministic finite automata, L-systems, parsing, multi-tape Turing machines, different kind of grammars and Nondeterministic Pushdown automata. As well as testing and making another example for these, JFLAP provide one to research with construction proofs from one form to another, such as converting an NFA to a DFA to a minimal state DFA to a regular expression or regular grammar. A Directed graph is be used to represent a Turing Machine, uses by JFLAP. It is widely used to simulate UTM as transducer of the Turing machine and it consists of multiple inputs.
关键词：Turing Machine; FSM; UTM; CFG; PDA; JFLAP; Recursive Enumerable ; grammar