To search, Click below search items.


All Published Papers Search Service


Computation Problems and Decidability: Finite State Halting Problems in Turning Machines


M. Muzammul, M. Awais, M. Yahya Saeed, Arfa Zaidi, Anaiza Akram


Vol. 18  No. 8  pp. 144-147


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