请选择 进入手机版 | 继续访问电脑版
楼主: nelsoncwlee
1629 1

[交易平台及行情软件] Concise Guide to Computation Theory [推广有奖]

  • 5关注
  • 82粉丝

学科带头人

62%

还不是VIP/贵宾

-

TA的文库  其他...

Financial Engineering

威望
1
论坛币
299830 个
通用积分
126.8746
学术水平
240 点
热心指数
288 点
信用等级
148 点
经验
240984 点
帖子
499
精华
0
在线时间
2716 小时
注册时间
2015-6-13
最后登录
2023-7-9

初级热心勋章 初级信用勋章 中级热心勋章

nelsoncwlee 发表于 2015-7-14 14:42:21 |显示全部楼层 |坛友微信交流群
相似文件 换一批

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币
This textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author’s extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness.


Editorial ReviewsReviewFrom the reviews:
“This work could certainly serve as a text for an undergraduate computer science course, and it might also be considered for presenting these essential modern ideas to students in other majors. … well-thought-out diagrams highlight important concepts and help elucidate proofs. An ideal text for a one-term course introducing computation theory to either majors or nonmajors; also appropriate for undergraduate self-study. Summing Up: Highly recommended. Upper-division undergraduates through professionals.”--- (P. Cull, Choice, Vol. 49 (3), November, 2011)
“The author walks a delicate path between presenting the breadth of topics and exploring all the depths of the theory, between writing a comprehensive (encyclopedic) textbook and providing a concise overview of the essential topics. … a concise introduction to the theory of computation, concentrating on the fundamental results that have the greatest impact on the theory and its practical applications. … very appropriate for graduate students in computer science or those academics who want a refresher course on the main results of the discipline.” (R. Goldberg, ACM Computing Reviews, March, 2012)


From the Back Cover

Computation lies at the heart of modern digital technology and our increasingly advanced information society. The theory of computation describes what tasks can and cannot be computed, and how efficiently the computable tasks can be computed.

This focused and accessible guide/textbook presents a thorough foundation to the theory of computation, whilst also providing a deeper insight for those looking to pursue research in this field. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Self-contained and supported by practical examples, the text is suitable for a one- or two-semester undergraduate course in the theory of computation.

Topics and features:

  • Presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites
  • Provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text
  • Draws upon the author’s extensive teaching experience and broad research interests
  • Discusses finite automata, context-free languages, and pushdown automata
  • Examines the concept, universality and limitations of the Turing machine
  • Investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness

This hands-on and easy-to-read textbook/reference is ideal for undergraduate students of computer science and related disciplines needing to develop a deep understanding of this fascinating field, even if they have no prior knowledge of the subject.

Dr. Akira Maruoka is a professor in the Faculty of Science and Engineering at Ishinomaki Senshu University, Japan.



Product Details
  • Hardcover: 281 pages
  • Publisher: Springer; 2011 edition (May 6, 2011)
  • Language: English
  • ISBN-10: 0857295349
  • ISBN-13: 978-0857295347


Akira_Maruoka_-_Concise_Guide_to_Computation_Theory.pdf (4.13 MB, 需要: 8 个论坛币)




二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:Computation Concise Theory Comput ATION foundation complexity structured concepts detailed

已有 1 人评分经验 论坛币 收起 理由
fantuanxiaot + 60 + 60 精彩帖子

总评分: 经验 + 60  论坛币 + 60   查看全部评分

本帖被以下文库推荐

pzh_hzp 发表于 2015-7-14 14:47:46 |显示全部楼层 |坛友微信交流群

使用道具

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
加好友,备注jr
拉您进交流群

京ICP备16021002-2号 京B2-20170662号 京公网安备 11010802022788号 论坛法律顾问:王进律师 知识产权保护声明   免责及隐私声明

GMT+8, 2024-3-28 16:43