Theory of automata, formal languages and computation / S.P. Eugene Xavier.

Format:

Book

Author/Creator:

Xavier, S. P. Eugene.

Language:

English

Subjects (All):

Computational complexity.

Machine theory.

Physical Description:

1 online resource (360 p.)

Edition:

1st ed.

Place of Publication:

New Delhi : New Age International (P) Ltd., Publishers, c2005.

Language Note:

English

Summary:

This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.

Contents:

Cover; Preface; Notations; Contents; Chapter 0. Introduction; Chapter 1. DFA and NFA; Chapter 2. Context-Free Grammars; Chapter 3. Pushdown Automata; Chapter 4. Turing Machines; Chapter 5. Chomsky Hier archy; Chapter 6. Computability; Chapter 7. Complexity Theory; Chapter 8. Propositions and Predicates; Answers to Exercises; University Question Papers; Bibliography; index

Notes:

Description based upon print version of record.

Includes bibliographical references and index.

ISBN:

1-281-22448-0

9786611224486

81-224-2334-5

OCLC:

309875657