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

A Cost Effective Scaling Approach for Cloud Applications 

Cloud computing is becoming an increasingly popular enterprise model in which computing resources are made available on-demand to the user as needed. In IT services the demand is not fixed and not predictable, henc...

http://ijarcet.org/wp-content/uploads/IJARCET-VOL-1-ISSUE-8-242-247.pdf 

Abstract--E-learning has been a topic of increasing interest in recent years, due to the fact that increased scheduling flexibility as well as tool support can now be offered at a widely affordable level. As a result,...

A SURVEY ON AD-HOC IN WIRELESS SENSOR NETWORKS 

- This paper says the performance of wireless ad hoc network. A wireless network has several types in it. For more expedient usage in the wireless trait ad hoc network is introduced. Ad-hoc network is a collection...

Low and mid-level features for target detection in satellite images 

Reliably detecting objects in broadarea overhead or satellite images has become an increasingly pressing need, as the capabilities for image acquisition are growing rapidly. The problem is particularly difficult in...

Comparative analysis between PCA and Fast ICA based Denoising of CFA Images for Single-Sensor Digital Cameras. 

Denoising of natural images is the fundamental and challenging research problem of Image processing. This problem appears to be very simple however that is not so when considered under practical situations, where the typ...

Download PDF file
  • EP ID EP115203
  • DOI -
  • Views 65
  • 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