Author : John C. Martin
Publisher : McGraw-Hill Science, Engineering & Mathematics
Page : 0 pages
File Size : 26,84 MB
Release : 2003
Category : Computable functions
ISBN : 9780072322002
Provides an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability. This book also includes an introduction to computational complexity and NP-completeness.
Author : Kamala Krithivasan
Publisher : Pearson Education India
Page : 446 pages
File Size : 38,86 MB
Release : 2009-09
Category : Computable functions
ISBN : 9788131723562
Introduction to Formal Languages, Automata Theory and Computation presents the theoretical concepts in a concise and clear manner, with an in-depth coverage of formal grammar and basic automata types. The book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology. An overview of the recent trends in the field and applications are introduced at the appropriate places to stimulate the interest of active learners.
Author : Shyamalendu Kandar
Publisher : Pearson Education India
Page : 657 pages
File Size : 40,24 MB
Release : 2013
Category : Formal languages
ISBN : 9332516324
Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems. The book has a simple and exhaustive approach to topics like automata theory, formal languages and theory of computation. These descriptions are followed by numerous relevant examples related to the topic. A brief introductory chapter on compilers explaining its relation to theory of computation is also given.
Author : John E. Hopcroft
Publisher :
Page : 488 pages
File Size : 17,49 MB
Release : 2014
Category : Computational complexity
ISBN : 9781292039053
This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Please note, Gradiance is no longer available with this book, as we no longer support this product.
Author : Michael Sipser
Publisher : Cengage Learning
Page : 0 pages
File Size : 21,1 MB
Release : 2012-06-27
Category : Computers
ISBN : 9781133187790
Now you can clearly present even the most complex computational theory topics to your students with Sipser’s distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today’s computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser’s well-known, approachable style with timely revisions, additional exercises, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. This edition’s refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject’s rigor and formalism. Readers gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E’s comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
Author : Michael Sipser
Publisher : Thomson/Course Technology
Page : 437 pages
File Size : 42,70 MB
Release : 2006
Category : Computational complexity
ISBN : 9780619217648
"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.
Author : Peter Linz
Publisher : Jones & Bartlett Publishers
Page : 408 pages
File Size : 49,29 MB
Release : 1997
Category : Computers
ISBN :
An Introduction to Formal Languages & Automata provides an excellent presentation of the material that is essential to an introductory theory of computation course. The text was designed to familiarize students with the foundations & principles of computer science & to strengthen the students' ability to carry out formal & rigorous mathematical argument. Employing a problem-solving approach, the text provides students insight into the course material by stressing intuitive motivation & illustration of ideas through straightforward explanations & solid mathematical proofs. By emphasizing learning through problem solving, students learn the material primarily through problem-type illustrative examples that show the motivation behind the concepts, as well as their connection to the theorems & definitions.
Author : K. L. P. Mishra
Publisher : PHI Learning Pvt. Ltd.
Page : 437 pages
File Size : 27,58 MB
Release : 2006-01-01
Category : Computers
ISBN : 8120329686
This Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, 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. NEW TO THIS EDITION • Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2) • A rigorous proof of Kleene’s theorem (Chapter 5) • Major changes in the chapter on Turing machines (TMs) – A new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and nondeterministic TM • A new chapter (Chapter 10) on decidability and recursively enumerable languages • A new chapter (Chapter 12) on complexity theory and NP-complete problems • A section on quantum computation in Chapter 12. • KEY FEATURES • Objective-type questions in each chapter—with answers provided at the end of the book. • Eighty-three additional solved examples—added as Supplementary Examples in each chapter. • Detailed solutions at the end of the book to chapter-end exercises. The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.
Author : Martin
Publisher :
Page : pages
File Size : 20,91 MB
Release :
Category :
ISBN : 9780070499393
Author : James L. Hein
Publisher : Jones & Bartlett Pub
Page : 572 pages
File Size : 10,70 MB
Release : 1996-01
Category : Computers
ISBN : 9780867204971
