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

Discovering Semantic Similarity between Words Using Web Document and Context Aware Semantic Association Ranking  

The growth of information in the web is too large, so search engine come to play a more critical role to find relation between input keywords. Semantic Similarity Measure is widely used in Information Retrieval (IR...

IDENTIFICATION OF HUMAN THROUGH PALMPRINT: A REVIEW 

Palm Print is one of the relatively new physiological biometrics, attracted the researchers due to its stable and unique characteristics. The rich feature information of palm print offers one of the powerful means...

A Review on Otsu Image Segmentation Algorithm 

Image segmentation is the fundamental approach of digital image processing. Among all the segmentation methods, Otsu method is one of the most successful methods for image thresholding because of its simple calculat...

Recognition and Classification of Broken Characters using Feed Forward Neural Network to Enhance an OCR Solution  

The major problem faced by an Optical Character Recognizer (OCR) can be attributed to the presence of a large number of broken characters in a digital document image. Recognition of such documents accurately, that...

A SIP Based Authentication Scheme for RFID Systems  

In today’s world of technology the biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers and providing secure authentication for RFID tags. Previously many soluti...

Download PDF file
  • EP ID EP115203
  • DOI -
  • Views 131
  • 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://www.europub.co.uk/articles/-A-115203