Introduction to theory of automata, formal languages and computation Debidas Ghosh

By:

Ghosh, Debidas

Material type: Text

TextLanguage: English Publication details: New Delhi : PHI Learning, 2013.Description: xx, 243 p.: ill.; 23 cmISBN:

9788120348073

Other title:

Theory of automata, formal languages and computation

Subject(s):

DDC classification:

511.3 GHO

Contents:

Preliminary Mathematical Review Three Basic Concepts: Grammar, Languages and Automata Finite Automata Regular Languages and Regular Grammars Properties of Regular Languages Context-Free Languages Pushdown Automata Properties of Context-Free Languages Turing Machine Other Models of Turing Machines Hierarchy of Formal Languages and Linear Bounded Automata Undecidability Theory of Computability Computational Complexity

Summary: The Theory of Computation or Automata and Formal Languages assumes significance as it has a wide range of applications in complier design, robotics, Artificial Intelligence (AI), and knowledge engineering. This compact and well-organized book provides a clear analysis of the subject with its emphasis on concepts which are reinforced with a large number of worked-out examples. The book begins with an overview of mathematical preliminaries. The initial chapters discuss in detail about the basic concepts of formal languages and automata, the finite automata, regular languages and regular expressions, and properties of regular languages. The text then goes on to give a detailed description of context-free languages, pushdown automata and computability of Turing machine, with its complexity and recursive features. The book concludes by giving clear insights into the theory of computability and computational complexity. This text is primarily designed for undergraduate (BE/B.Tech.) students of Computer Science and Engineering (CSE) and Information Technology (IT), postgraduate students (M.Sc.) of Computer Science, and Master of Computer Applications (MCA).

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Barcode
General Books	CUTN Central Library Sciences	Non-fiction	511.3 GHO (Browse shelf(Opens below))	Available	33913
General Books	CUTN Central Library Sciences	Non-fiction	511.3 GHO (Browse shelf(Opens below))	Available	33914
General Books	CUTN Central Library Sciences	Non-fiction	511.3 GHO (Browse shelf(Opens below))	Available	34266
General Books	CUTN Central Library Sciences	Non-fiction	511.3 GHO (Browse shelf(Opens below))	Available	34267
Reference Books	CUTN Central Library Sciences	Reference	511.3 GHO (Browse shelf(Opens below))	Not For Loan	34268

Preliminary Mathematical Review
Three Basic Concepts: Grammar, Languages and Automata

Finite Automata

Regular Languages and Regular Grammars

Properties of Regular Languages

Context-Free Languages

Pushdown Automata

Properties of Context-Free Languages

Turing Machine

Other Models of Turing Machines

Hierarchy of Formal Languages and Linear Bounded Automata

Undecidability

Theory of Computability

Computational Complexity

The Theory of Computation or Automata and Formal Languages assumes significance as it has a wide range of applications in complier design, robotics, Artificial Intelligence (AI), and knowledge engineering. This compact and well-organized book provides a clear analysis of the subject with its emphasis on concepts which are reinforced with a large number of worked-out examples.

The book begins with an overview of mathematical preliminaries. The initial chapters discuss in detail about the basic concepts of formal languages and automata, the finite automata, regular languages and regular expressions, and properties of regular languages. The text then goes on to give a detailed description of context-free languages, pushdown automata and computability of Turing machine, with its complexity and recursive features. The book concludes by giving clear insights into the theory of computability and computational complexity.

This text is primarily designed for undergraduate (BE/B.Tech.) students of Computer Science and Engineering (CSE) and Information Technology (IT), postgraduate students (M.Sc.) of Computer Science, and Master of Computer Applications (MCA).

There are no comments on this title.

to post a comment.