Introduction to Languages and the Theory of Computation
Title | Introduction to Languages and the Theory of Computation PDF eBook |
Author | John C. Martin |
Publisher | McGraw-Hill Science, Engineering & Mathematics |
Total Pages | 0 |
Release | 2003 |
Genre | 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.
Introduction to Languages and the Theory of Computation
Title | Introduction to Languages and the Theory of Computation PDF eBook |
Author | John C. Martin |
Publisher | McGraw-Hill Companies |
Total Pages | 568 |
Release | 2003 |
Genre | Computable functions |
ISBN |
Introduction to Languages and the Theory of Computationis an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness. Through the study of these topics, students encounter profound computational questions and are introduced to topics that will have an ongoing impact in computer science. Once students have seen some of the many diverse technologies contributing to computer science, they can also begin to appreciate the field as a coherent discipline. A distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used. Martin takes advantage of the clarity and precision of mathematical language but also provides discussion and examples that make the language intelligible to those just learning to read and speak it. The material is designed to be accessible to students who do not have a strong background in discrete mathematics, but it is also appropriate for students who have had some exposure to discrete math but whose skills in this area need to be consolidated and sharpened.
Introduction to the Theory of Computation
Title | Introduction to the Theory of Computation PDF eBook |
Author | Michael Sipser |
Publisher | Thomson/Course Technology |
Total Pages | 437 |
Release | 2006 |
Genre | 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.
Introduction to languages and the theory of computation
Title | Introduction to languages and the theory of computation PDF eBook |
Author | John C. Martin |
Publisher | |
Total Pages | 450 |
Release | 1997 |
Genre | |
ISBN | 9780074637227 |
Introduction to Languages and the Theory of Computation
Title | Introduction to Languages and the Theory of Computation PDF eBook |
Author | John Martin |
Publisher | McGraw-Hill Education |
Total Pages | 0 |
Release | 2010-02-02 |
Genre | Computers |
ISBN | 9780073191461 |
Introduction to Languages and the Theory of Computation helps students make the connection between the practice of computing and an understanding of the profound ideas that defines it. The book's organization and the author's ability to explain complex topics clearly make this introduction to the theory of computation an excellent resource for a broad range of upper level students. The author has learned through many years of teaching that the best way to present theoretical concepts is to take advantage of the precision and clarity of mathematical language. In a way that is accessible to students still learning this language, he presents the necessary mathematical tools gently and gradually which provides discussion and examples that make the language intelligible.
Introduction to Formal Languages, Automata Theory and Computation
Title | Introduction to Formal Languages, Automata Theory and Computation PDF eBook |
Author | Kamala Krithivasan |
Publisher | Pearson Education India |
Total Pages | 446 |
Release | 2009-09 |
Genre | 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.
A Concise Introduction to Languages and Machines
Title | A Concise Introduction to Languages and Machines PDF eBook |
Author | Alan P. Parkes |
Publisher | Springer Science & Business Media |
Total Pages | 348 |
Release | 2009-06-29 |
Genre | Computers |
ISBN | 1848001215 |
A Concise Introduction to Languages, Machines and Logic provides an accessible introduction to three key topics within computer science: formal languages, abstract machines and formal logic. Written in an easy-to-read, informal style, this textbook assumes only a basic knowledge of programming on the part of the reader. The approach is deliberately non-mathematical, and features: - Clear explanations of formal notation and jargon, - Extensive use of examples to illustrate algorithms and proofs, - Pictorial representations of key concepts, - Chapter opening overviews providing an introduction and guidance to each topic, - End-of-chapter exercises and solutions, - Offers an intuitive approach to the topics. This reader-friendly textbook has been written with undergraduates in mind and will be suitable for use on course covering formal languages, formal logic, computability and automata theory. It will also make an excellent supplementary text for courses on algorithm complexity and compilers.