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

Introduction to Formal Languages, Automata Theory and Computation

by Kamala Krithivasan, R Rama
April 2009
Intermediate to advanced
440 pages
9h 51m
English
Pearson India
Content preview from Introduction to Formal Languages, Automata Theory and Computation

Chapter 6. Variants of Finite Automata

We have seen that DFSA, NFSA, and NFSA with ε-moves have the same power. They accept the family of regular sets. In this chapter, we consider two generalized versions of FSA. While one of them accepts only regular sets, the other accepts sets, which are not regular. We also have a discussion on probabilistic finite automata and weighted finite automata. These two models have applications in image analysis.

Two-Way Finite Automata

A two-way deterministic finite automaton (2DFSA) is a quintuple M = (K, Σ, δ, q0, F) where K, Σ, q0, F are as in DFSA and δ is a mapping from K × Σ into K × {L, R}.

The input tape head can move in both directions. The machine starts on the leftmost symbol of the input in the initial ...

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: 9788131723562