| 书目名称 | Elements of Computation Theory | | 编辑 | Arindama Singh | | 视频video | | | 概述 | A comprehensive and up-to-date treatment of all the essential topics in formal languages, automata, computability, and complexity.Each chapter contains examples, exercises, summaries, and bibliographi | | 丛书名称 | Texts in Computer Science | | 图书封面 |  | | 描述 | The foundation of computer science is built upon the following questions: What is an algorithm? What can be computed and what cannot be computed? What does it mean for a function to be computable? How does computational power depend upon programming constructs? Which algorithms can be considered feasible? For more than 70 years, computer scientists are searching for answers to such qu- tions. Their ingenious techniques used in answering these questions form the theory of computation. Theory of computation deals with the most fundamental ideas of computer s- ence in an abstract but easily understood form. The notions and techniques employed are widely spread across various topics and are found in almost every branch of c- puter science. It has thus become more than a necessity to revisit the foundation, learn the techniques, and apply them with con?dence. Overview and Goals This book is about this solid, beautiful, and pervasive foundation of computer s- ence. It introduces the fundamental notions, models, techniques, and results that form the basic paradigms of computing. It gives an introduction to the concepts and mathematics that computer scientists of our day use to model, to a | | 出版日期 | Textbook 2009 | | 关键词 | Algorithms; Computability; Computation; Formal Languages; Text; automata; complexity; formal language | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-84882-497-3 | | isbn_softcover | 978-1-4471-6142-4 | | isbn_ebook | 978-1-84882-497-3Series ISSN 1868-0941 Series E-ISSN 1868-095X | | issn_series | 1868-0941 | | copyright | Springer-Verlag London 2009 |
The information of publication is updating
|
|
发表于 2025-3-21 16:24:24
