Comparative Study of Two-way Finite Automata and Turing machine  

Abstract

Two-way finite Automata are termed as read only Turing machine. Two way finite automata is one of variant of Turing machine, which is blessed with an infinite tape, and could be used by tape head to read or write into its cell. Though Two way finite automata has it reservation as it is only read only with finite tape but many times unlimited storage is not required. This paper do comparative study to find out how Two way finite automata and Turing machine are different and whether any of the two have advantage over other or not.  

Authors and Affiliations

Sumaiya Faizyab

Keywords

Related Articles

Survey on Data Sharing and Re-Encryption in Cloud 

Cloud storage helps enterprises and government agencies significantly reduce their financial overhead of data management, since they can now archive their data backups remotely to third-party cloud storage provider...

Fairness of Optimistic ID-Based Concurrent Signature Schemes 

Concurrent signature scheme was introduced by Chen, Kudla and Paterson in Eurocrypt 2004. In these concurrent signature schemes, two parties can produce two ambiguous signatures. These signatures bind to their true...

Transformation of Graph Partitions into Problem Domain in Digital Circuit Layout

The digital circuit layout problem is a constrained optimization problem in the combinatorial sense. It is accomplished in several stages such as partitioning, floorplanning, placement and routing with each step being...

Detection of traditional and new types of Malware using Host-based detection scheme  

In this paper, we have discussed many traditional and new types of worms including c-worms also-worms stands for camouflaging worms because of its nature of self propagating and hiding nature. An active worm refers to a...

Technologies of Cloud Computing - Architecture Concepts based on Security and its Challenges 

Cloud computing is becoming a powerful network architecture to perform large-scale and complex computing. we present a survey of cloud computing, highlighting its key concepts, architectural principles, state-of-...

Download PDF file
  • EP ID EP115203
  • DOI -
  • Views 107
  • Downloads 0

How To Cite

Sumaiya Faizyab (2013). Comparative Study of Two-way Finite Automata and Turing machine  . International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 2(6), 2205-2207. https://europub.co.uk/articles/-A-115203