Skip to Content
Introduction to Automata Theory, Formal Languages and Computation
book

Introduction to Automata Theory, Formal Languages and Computation

by Shyamalendu Kandar
January 2013
Beginner to intermediate
650 pages
16h 11m
English
Pearson India
Content preview from Introduction to Automata Theory, Formal Languages and Computation

8

Turing Machine

Introduction

Around 1936, when there were no computers, Alen Turing proposed a model of an abstract machine called the Turing machine which could perform any computational process carried out by the present day’s computer. The machine was named after Turing, and it is called the Turing machine. The Turing machine is the machine format of unrestricted language, i.e., all types of languages are accepted by the Turing machine.

Based on the Turing machine, a new theory called the ‘theory of undecidable problems’ is developed. These types of problems cannot be solved by any computer.

8.1  Basics of Turing Machine

The Turing machine, in short TM, is defined by 7 touples

 

(Q, Σ, Γ, δ, q0, B, F)

 

where

    Q : Finite set of states ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

Introduction to Formal Languages, Automata Theory and Computation

Introduction to Formal Languages, Automata Theory and Computation

Kamala Krithivasan, R Rama
Automata Theory and Formal Languages

Automata Theory and Formal Languages

Pallavi Vijay Chavan, Ashish Jadhav

Publisher Resources

ISBN: 9788131793510