Skip to Content
Formal Languages and Automata Theory
book

Formal Languages and Automata Theory

by K.V.N. Sunitha
April 2015
Intermediate to advanced
482 pages
11h 42m
English
Pearson Education India
Content preview from Formal Languages and Automata Theory

6

Turing Machines

  • Turing machine is a yardstick for computations that can be carried out on a digital computer. Turing machines, first described by Alan Turing in (Turing 1937), are simple, abstract, computational devices intended to help investigate the extent and limitations of what can be computed.

In this chapter, we discuss Turing machines (TMs) and their applications. Turing, writing before the invention of the modern digital computer, was interested in the question of what it means to be computable? Intuitively, a task is computable if one can specify a sequence of instructions which when followed will result in the completion of the task. Such a set of instructions is called an effective procedure, or algorithm, for the task. This ...

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 Automata Theory, Formal Languages and Computation

Introduction to Automata Theory, Formal Languages and Computation

Shyamalendu Kandar

Publisher Resources

ISBN: 9789332558274