Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Theory of Computer Science: Automata, Languages and Computation, 3/E

N. Chandrasekaran

4/5 ( ratings)

Theory of Computer Science is a book designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students who are pursuing the course on computer applications. The book is now in its third edition, and offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries as well as well. The new edition also comes in with an expanded section on pigeonhole principle and the principle of induction and a new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and non-deterministic TM. Two new chapters on Decidability and Recursively Enumerable Languages and Complexity Theory and NP-complete Problems are also added.

Language: English

Pages: 436

Format: Kindle Edition

Publisher: PHI Learning Private Limited

Release: February 08, 2013

Theory of Computer Science: Automata, Languages and Computation, 3/E

N. Chandrasekaran

4/5 ( ratings)

Theory of Computer Science is a book designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students who are pursuing the course on computer applications. The book is now in its third edition, and offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries as well as well. The new edition also comes in with an expanded section on pigeonhole principle and the principle of induction and a new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and non-deterministic TM. Two new chapters on Decidability and Recursively Enumerable Languages and Complexity Theory and NP-complete Problems are also added.

Language: English

Pages: 436

Format: Kindle Edition

Publisher: PHI Learning Private Limited

Release: February 08, 2013

More books from N. Chandrasekaran

Bridgital Nation: Solving Technology's People Problem

3.8/5 ( ratings)

Incredible Champions

4.5/5 ( ratings)

Discrete Mathematics

4.5/5 ( ratings)

Discrete Mathematics

4.5/5 ( ratings)

Rate this book!

Write a review?