Formal Languages and Automata Theory
Price: 675.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198071068
Publication date:
07/04/2011
Paperback
364 pages
242.0x186.0mm
Price: 675.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198071068
Publication date:
07/04/2011
Paperback
364 pages
242.0x186.0mm
Formal Languages and Automata Theory is designed to serve as a textbook for undergraduate and postgraduate students of engineering (computer science and information technology) and computer applications.
Suitable for: Formal Languages and Automata Theory is designed to serve as a textbook for undergraduate and postgraduate students of engineering (computer science and information technology) and computer applications.
Rights: World Rights
Description
Formal Languages and Automata Theory is designed to serve as a textbook for undergraduate and postgraduate students of engineering (computer science and information technology) and computer applications.
The book provides extensive coverage of essential topics such as computability, formal languages, models of computation-automation, complexity theory, NP completeness, and decidability.
Beginning with the basic aspects of automata theory and its relevance to computer science, the book goes on to discuss the concepts of formalism and computability and discrete mathematical structures. A discussion of important topics such as regular sets and grammar, context-free languages, and various types of automata such as deterministic finite automata, nondeterministic finite automata, pushdown automata, linear-bound automata is provided. Special emphasis is laid on the design and applications of Turing machines. The book also provides an in-depth discussion on the topic of decidability and its association with recursive and recursively enumerable languages. Explicit coverage has been given to time complexity aspect of computability and its manifestation in the form of P and NP classes.
Table of contents
Chapter 1. Automata, Formal Languages, and Computability
Chapter 2. Mathematical Preliminaries
Chapter 3. Finite Automata
Chapter 4. Regular Grammar and Regular Sets
Chapter 5. Context-free Grammars and Languages
Chapter 6. Pushdown Automata
Chapter 7. Turing Machines
Chapter 8. The Pitfall of Algorithmic Computing: Undesirability
Chapter 9. Computable Functions
Chapter 10. Computational Complexity: Tractable and Possibly Intractable Problems
Features
- Presents complex mathematical concepts in a simplified manner
- Provides several solved examples as well as supplementary examples in each chapter for better recapitulation of concepts
- Includes numerous multiple-choice questions with answers, and problems for practice at the end of each chapter
- Includes appendices on Church-Turing thesis, Godel numbering, key scientists, and important events in this field
Description
Formal Languages and Automata Theory is designed to serve as a textbook for undergraduate and postgraduate students of engineering (computer science and information technology) and computer applications.
The book provides extensive coverage of essential topics such as computability, formal languages, models of computation-automation, complexity theory, NP completeness, and decidability.
Beginning with the basic aspects of automata theory and its relevance to computer science, the book goes on to discuss the concepts of formalism and computability and discrete mathematical structures. A discussion of important topics such as regular sets and grammar, context-free languages, and various types of automata such as deterministic finite automata, nondeterministic finite automata, pushdown automata, linear-bound automata is provided. Special emphasis is laid on the design and applications of Turing machines. The book also provides an in-depth discussion on the topic of decidability and its association with recursive and recursively enumerable languages. Explicit coverage has been given to time complexity aspect of computability and its manifestation in the form of P and NP classes.
Read MoreTable of contents
Chapter 1. Automata, Formal Languages, and Computability
Chapter 2. Mathematical Preliminaries
Chapter 3. Finite Automata
Chapter 4. Regular Grammar and Regular Sets
Chapter 5. Context-free Grammars and Languages
Chapter 6. Pushdown Automata
Chapter 7. Turing Machines
Chapter 8. The Pitfall of Algorithmic Computing: Undesirability
Chapter 9. Computable Functions
Chapter 10. Computational Complexity: Tractable and Possibly Intractable Problems
