文章基本信息

标题：Computation Problems and Decidability: Finite State Halting Problems in Turning Machines
本地全文：下载
作者：M. Muzammul ; M. Awais ; M. Yahya Saeed 等
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2018
卷号：18
期号：8
页码：144-147
出版社：International Journal of Computer Science and Network Security
摘要：In this paper we are going to discuss different type of model based computation languages like Finite automata, turning machine, Pushdown automata. The main reason behind this research is that, understanding the decidability of halting problems. It accomplish a proof of stated argument that some computational languages are decidable but some questions cannot decidable. Limited automata and standard dialects have been helpful in a wide assortment of issues in calculation, correspondence and control incorporate formal demonstrating and confirmation. This paper provide the decidable problem of finite automata (NFA, DFA), pushdown and turning machine. We summarize the discussion with some problems and provide the theorems as well.
关键词：;;;; ;;;;;; Decidability of halting problems; decidability computation; finite automata; turning machine decidability