M. (Michael) Sipser - Search - Anna’s Archive

Search settings

Order by

Advanced

Search descriptions and metadata comments

Add specific search field

Content

Filetype open our viewer

more…

Access

Source

Language

more…

Display

Search settings

Download Journal articles Digital Lending Metadata

Results 1-18 (18 total)

nexusstc/Instructor Solution Manual To Accompany Introduction to the Theory of Computation, Third Edition (Intro Theory Computation, 3rd ed, 3e, Solutions)/48e30972587d0bca86ff1677459ed101.pdf

Instructor Solution Manual To Accompany Introduction to the Theory of Computation, Third Edition (Intro Theory Computation, 3rd ed, 3e, Solutions) M. (Michael) Sipser Course Technology Cengage Learning, 3, 2012

the official solutions manual for the \*third edition\* of the classic tome.

English [en] · PDF · 1.5MB · 2012 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11065.0, final score: 167487.2

nexusstc/计算理论导论/f5a7762b9351a5d798b64cabf6bd7f81.pdf

计算理论导论 : 英文版 = Introduction to the Theory of Computation (美) 塞普斯, M 机械工业出版社 : 中信出版社, 经典原版书库, 2002

This book——by a noted authority and educator in the field——presents computer science theory from a uniquely intuitive,“big picture”perspective.The author grounds his clear and interesting study on broad mathematical princi-ples,not low-level technical details:proofs are presented with a “proof idea”component that re- veals the concetp underlying the mathematical formalism.Simil... This book——by a noted authority and educator in the field——presents computer science theory from a uniquely intuitive,“big picture”perspective.The author grounds his clear and interesting study on broad mathematical princi-ples,not low-level technical details:proofs are presented with a “proof idea”component that re- veals the concetp underlying the mathematical formalism.Similarly,algorithms are pr-esented using prose rather than pseudocode to focus attention on the algorithms the- mselves,rather than on specific models.Formerly published in a Preliminary Edition, this First Edition features additional chapters on space complexity (Chapter 8),pro-vable intractability (Chapter 9)and advanced topics in computability theory(Chapter 10).For further information,see the World Wide Web site for the book at: math.mit.edu/sipser/book.html

Chinese [zh] · PDF · 7.6MB · 2002 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11060.0, final score: 17485.746

lgli/Sipser M. Introduction to the Theory of Computation 3ed 2013.pdf

Introduction to the Theory of Computation Michael Sipser Course Technology Cengage Learning, 3. ed., internat. ed, Erscheinungsort nicht ermittelbar, 2013

Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, 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. You 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 a valuable reference for your continued studies in theoretical computing.

English [en] · PDF · 25.0MB · 2013 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/zlib · Save

base score: 11065.0, final score: 1.6750202

lgli/kolxo3-65/Cs_Computer science/CsNp_Computability/Sipser M. Introduction to the Theory of Computation (3ed., Cengage, 2012)(ISBN 113318779X)(O)(482s)_CsNp_.pdf

Introduction to the Theory of Computation Sipser, Michael Course Technology Cengage Learning, 3ed., 2012

English [en] · PDF · 5.6MB · 2012 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11065.0, final score: 1.675013

Your ad here.

upload/wll/ENTER/Science/IT & AI/1 - More Books on IT/IT Science and Programming/Computer science/Computability/Sipser M. Introduction to the theory of computation (PWS, 1997)(ISBN 053494728X)(K)(T)(410s)_CsNp_.djvu

Introduction to the theory of computation Michael Sipser PWS Publishing Company, 1, 1997

There is not too much to say about this spectacular textbook that has not been said already by many of the other reviewers. This is a wonderful presentation of key ideas in complexity, on that fulfills a big hole in the literature.The presentation is notable for its clarity. In exposition, the author chooses one important idea and carefully but clearly develops that single idea. By contrast, certain other textbook authors (who shall remain nameless) tend to try and present so many variants of the same idea that the reader gets bogged down and loses sight of the key elements.Michael Sipser, perhaps ironically, is known for some fiendishly complex proofs in complexity theory (e.g. Go is PSPACE hard). Despite that, the book is a model of clarity. Not surprisingly, the book really shines in its completeness presentation, where NP-completeness, PSPACE completeness, and the equivalence of IP and PSPACE are shown with great power and verve. Perhaps my only reservation is that the book is a bit light on the recursive hierarchy, but there's enough for the curious student. Also, lets face it, nowadays the custom is probably to have more pictures and color - a teacher might want to supplement some of the proofs with demos, or the enterprising student unfamiliar with the area could do so himself.Finally, the book has some superb special topics that make it a necessity and make most of the older theory of computation books entirely obsolete. There are great introductions to Interactive Proofs, Probabilistic Computing, Parallel Computing, and Information Theory. And nice nuances throughout, like the proof that P=NP is not relativization-independent.All in all, this is one of those very rare books that are written by a top practitioner and theorist on the one hand, yet at the same time are clear and well-motivated for the reader.Conclusion: presentation: terrific. Choice of topics: terrific. Writing style: terrific. Clarity: terrific. It's a great text.

English [en] · DJVU · 3.7MB · 1997 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save

base score: 11055.0, final score: 1.6749803

lgli/A:\usenetabtechnical\Introduction to the Theory of Computation - M. Sipser (PWS, 1997) WW.pdf

Introduction to the theory of computation Michael Sipser PWS Publishing Company, 1, 1997

English [en] · PDF · 16.4MB · 1997 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11065.0, final score: 1.6749709

upload/newsarch_ebooks/2021/02/16/053494728X_Introduction.pdf

Introduction to the Theory of Computation Michael Sipser PWS Publishing Company, 1, 1996

English [en] · PDF · 17.8MB · 1996 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save

base score: 11065.0, final score: 1.6749524

upload/motw_shc_2025_10/shc/Introduction to the Theory of Computation - Michael Sipser.pdf

Introduction to the Theory of Computation, Third Edition Michael Sipser Course Technology Cengage Learning, Third edition, Boston, MA, 2013

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. Cover 1 Statement 2 Title Page 3 Copyright 4 Dedication 5 Contents 7 Preface to the First Edition 13 Preface to the Second Edition 19 Preface to the Third Edition 23 Ch 0: Introduction 25 0.1 Automata, Computability, and Complexity 25 0.2 Mathematical Notions and Terminology 27 0.3 Definitions, Theorems, and Proofs 41 0.4 Types of Proof 45 Exercises 49 Problems 51 Selected Solutions 52 Part 1: Automata and Languages 53 Ch 1: Regular Languages 55 Introduction 55 1.1 Finite Automata 55 1.2 Nondeterminism 71 1.3 Regular Expressions 87 1.4 Nonregular Languages 101 Exercises 107 Problems 112 Selected Solutions 118 Ch 2: Context-Free Languages 125 Introduction 125 2.1 Context-Free Grammars 126 2.2 Pushdown Automata 135 2.3 Non-Context-Free Languages 149 2.4 Deterministic Context-Free Languages 154 Exercises 178 Problems 180 Selected Solutions 184 Part 2: Computability Theory 187 Ch 3: The Church–Turing Thesis 189 Introduction 189 3.1 Turing Machines 189 3.2 Variants of Turing Machines 200 3.3 The Definition of Algorithm 206 Exercises 211 Problems 212 Selected Solutions 214 Ch 4: Decidability 217 Introduction 217 4.1 Decidable Languages 218 4.2 Undecidability 225 Exercises 234 Problems 235 Selected Solutions 237 Ch 5: Reducibility 239 Introduction 239 5.1 Undecidable Problems From Language Theory 240 5.2 A Simple Undecidable Problem 251 5.3 Mapping Reducibility 258 Exercises 263 Problems 263 Selected Solutions 266 Ch 6: Advanced Topics in Computability Theory 269 Introduction 269 6.1 The Recursion Theorem 269 6.2 Decidability of logical theories 276 6.3 Turing Reducibility 284 6.4 A Definition of Information 285 Exercises 294 Problems 294 Selected Solutions 296 Part 3: Complexity Theory 297 Ch 7: Time Complexity 299 Introduction 299 7.1 Measuring Complexity 299 7.2 The Class P 308 7.3 The Class NP 316 7.4 NP-completeness 323 7.5 Additional NP-complete Problems 335 Exercises 346 Problems 347 Selected Solutions 353 Ch 8: Space Complexity 355 Introduction 355 8.1 Savitch’s Theorem 357 8.2 The Class PSPACE 360 8.3 PSPACE-completeness 361 8.4 The Classes L and NL 372 8.5 NL-completeness 375 8.6 NL equals coNL 378 Exercises 381 Problems 382 Selected Solutions 384 Ch 9: Intractability 387 Introduction 387 9.1 Hierarchy Theorems 388 9.2 Relativization 400 9.3 Circuit Complexity 403 Exercises 413 Problems 413 Selected Solutions 415 Ch 10: Advanced Topics in Complexity Theory 417 Introduction 417 10.1 Approximation Algorithms 417 10.2 Probabilistic Algorithms 420 10.3 Alternation 432 10.4 Interactive Proof Systems 439 10.5 Parallel Computation 451 10.6 Cryptography 457 Exercises 463 Problems 463 Selected Solutions 465 Selected Bibliography 467 Index 472 Computers,Computer Science

English [en] · PDF · 10.9MB · 2013 · 📘 Book (non-fiction) · 🚀/lgli/upload/zlib · Save

base score: 11068.0, final score: 1.6748987

upload/newsarch_ebooks/2021/06/19/053437462X_Introduction.djvu

Introduction to the theory of computation. Instructor's manual: solutions to 1ed., 1997 Ching Law, Edmond Kayi Lee, Michael Sipser, Zulfikar Ramzan International Thomson Publishing, 1, 1999

Michael Sipser's emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own.

English [en] · DJVU · 0.9MB · 1999 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save

base score: 11050.0, final score: 1.6748643

Your ad here.

upload/wll/ENTER/Science/IT & AI/1 - More Books on IT/IT Science and Programming/Computer science/Computability/Sipser M. Introduction to the theory of computation (2005)(600dpi)(T)(ISBN 0534950973)(453s)_CsNp_.djvu

Introduction to the theory of computation Michael (Michael Sipser) Sipser Course Technology; Thomson Course Technology, 2nd, International ed, Boston, 2006

This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter. Amazon.com Review "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.

English [en] · DJVU · 5.2MB · 2006 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save

base score: 11055.0, final score: 1.6748517

lgli/kolxo3-65/Cs_Computer science/CsNp_Computability/Sipser M. Introduction to the theory of computation (2ed., Thomson, 2005)(ISBN 0534950973)(600dpi)(ISBN 0534950973)(T)(453s)_CsNp_.djvu

Introduction to the theory of computation Michael Sipser Course Technology; Thomson Course Technology, 2 edition, February 15, 2005

This highly anticipated revision of Michael Sipser's popular text builds upon the strengths of the previous edition. It tells the fascinating story of the theory of computation-a subject with beautiful results and exciting unsolved questions at the crossroads of mathematics and computer science. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative II proof idea" sections reveal the intuition underpinning the formal proofs of theorems by explaining profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years and offers completely updated, classroom-tested problem sets with sample solutions at the end of each chapter.

English [en] · DJVU · 5.1MB · 2005 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11055.0, final score: 1.6748341

upload/wll/ENTER/Science/Physics & Math/1 - More Books on IT & Math/Theory Of Computation/Introduction To The Theory Of Computation - Michael Sipser.djvu

Introduction to the theory of computation Michael Sipser Course Technology; Thomson Course Technology, 2nd, International ed, Boston, 2006

English [en] · DJVU · 6.9MB · 2006 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save

base score: 11055.0, final score: 1.6747485

lgli/Sipser M. Introduction to the theory of computation (1997) Solutions (MIT, 1999)(61s) CsNp .djvu

Introduction to the theory of computation. Solutions Michael Sipser Course Technology Cengage Learning, 1999

English [en] · DJVU · 3.7MB · 1999 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/zlib · Save

❌ This file might have issues.

base score: 0.01, final score: 1.5003284

upload/duxiu_main/v/pdf/40371655.pdf

Introduction to the Theory of Computation Second Edition (美)Michael Sipser著; Pser Si 机械工业出版社, 2006, 2006

封面 1 书名 3 版权 4 前言 5 目录 15 1 20 2 21 3 22 4 23 5 24 6 25 7 26 8 27 9 28 10 29 11 30 12 31 13 32 14 33 15 34 16 35 17 36 18 37 19 38 20 39 21 40 22 41 23 42 24 43 25 44 26 45 27 46 28 47 29 48 30 49 31 50 32 51 33 52 34 53 35 54 36 55 37 56 38 57 39 58 40 59 41 60 42 61 43 62 44 63 45 64 46 65 47 66 48 67 49 68 50 69 51 70 52 71 53 72 54 73 55 74 56 75 57 76 58 77 59 78 60 79 61 80 62 81 63 82 64 83 65 84 66 85 67 86 68 87 69 88 70 89 71 90 72 91 73 92 74 93 75 94 76 95 77 96 78 97 79 98 80 99 81 100 82 101 83 102 84 103 85 104 86 105 87 106 88 107 89 108 90 109 91 110 92 111 93 112 94 113 95 114 96 115 97 116 98 117 99 118 100 119 101 120 102 121 103 122 104 123 105 124 106 125 107 126 108 127 109 128 110 129 111 130 112 131 113 132 114 133 115 134 116 135 117 136 118 137 119 138 120 139 121 140 122 141 123 142 124 143 125 144 126 145 127 146 128 147 129 148 130 149 131 150 132 151 133 152 134 153 135 154 136 155 137 156 138 157 139 158 140 159 141 160 142 161 143 162 144 163 145 164 146 165 147 166 148 167 149 168 150 169 151 170 152 171 153 172 154 173 155 174 156 175 157 176 158 177 159 178 160 179 161 180 162 181 163 182 164 183 165 184 166 185 167 186 168 187 169 188 170 189 171 190 172 191 173 192 174 193 175 194 176 195 177 196 178 197 179 198 180 199 181 200 182 201 183 202 184 203 185 204 186 205 187 206 188 207 189 208 190 209 191 210 192 211 193 212 194 213 195 214 196 215 197 216 198 217 199 218 200 219 201 220 202 221 203 222 204 223 205 224 206 225 207 226 208 227 209 228 210 229 211 230 212 231 213 232 214 233 215 234 216 235 217 236 218 237 219 238 220 239 221 240 222 241 223 242 224 243 225 244 226 245 227 246 228 247 229 248 230 249 231 250 232 251 233 252 234 253 235 254 236 255 237 256 238 257 239 258 240 259 241 260 242 261 243 262 244 263 245 264 246 265 247 266 248 267 249 268 250 269 251 270 252 271 253 272 254 273 255 274 256 275 257 276 258 277 259 278 260 279 261 280 262 281 263 282 264 283 265 284 266 285 267 286 268 287 269 288 270 289 271 290 272 291 273 292 274 293 275 294 276 295 277 296 278 297 279 298 280 299 281 300 282 301 283 302 284 303 285 304 286 305 287 306 288 307 289 308 290 309 291 310 292 311 293 312 294 313 295 314 296 315 297 316 298 317 299 318 300 319 301 320 302 321 303 322 304 323 305 324 306 325 307 326 308 327 309 328 310 329 311 330 312 331 313 332 314 333 315 334 316 335 317 336 318 337 319 338 320 339 321 340 322 341 323 342 324 343 325 344 326 345 327 346 328 347 329 348 330 349 331 350 332 351 333 352 334 353 335 354 336 355 337 356 338 357 339 358 340 359 341 360 342 361 343 362 344 363 345 364 346 365 347 366 348 367 349 368 350 369 351 370 352 371 353 372 354 373 355 374 356 375 357 376 358 377 359 378 360 379 361 380 362 381 363 382 364 383 365 384 366 385 367 386 368 387 369 388 370 389 371 390 372 391 373 392 374 393 375 394 376 395 377 396 378 397 379 398 380 399 381 400 382 401 383 402 384 403 385 404 386 405 387 406 388 407 389 408 390 409 391 410 392 411 393 412 394 413 395 414 396 415 397 416 398 417 399 418 400 419 401 420 402 421 403 422 404 423 405 424 406 425 407 426 408 427 409 428 410 429 411 430 412 431 413 432 414 433 415 434 416 435 417 436 418 437 419 438 420 439 421 440 422 441 423 442 424 443 425 444 426 445 427 446 428 447 429 448 430 449 431 450 432 451 433 452 434 453 435 454 436 455 437 456

Chinese [zh] · PDF · 25.1MB · 2006 · 📗 Book (unknown) · 🚀/upload/zlibzh · Save

base score: 11063.0, final score: 0.17490716

Your ad here.

ia/isbn_9787111108405_0.pdf

计算理论导论 : 英文版 = Introduction to the Theory of Computation Michael Sipser Bei jing: Ji xie gong ye chu ban she, Jing dian yuan ban shu ku, Jing dian yuan ban shu ku, Ying yin ban, Bei jing, China, 2002

Chinese [zh] · PDF · 19.9MB · 2002 · 📗 Book (unknown) · 🚀/ia · Save

base score: 11060.0, final score: 0.17490041

duxiu/initial_release/11611700.zip

计算理论导引（第2版） (美)塞普瑟(Sipser,M.)著;唐常杰等译, (美)Michael Sipser著 , 唐常杰[等]译, 西普塞, 唐常杰北京:机械工业出版社, 2006, 2006

1 (p1): 第0章绪论 1 (p1-1): 0.1 自动机、可计算性与复杂性 1 (p1-1-1): 0.1.1 计算复杂性理论 2 (p1-1-2): 0.1.2 可计算性理论 2 (p1-1-3): 0.1.3 自动机理论 2 (p1-2): 0.2 数学概念和术语 2 (p1-2-1): 0.2.1 集合 3 (p1-2-2): 0.2.2 序列和多元组 4 (p1-2-3): 0.2.3 函数和关系 6 (p1-2-4): 0.2.4 图 7 (p1-2-5): 0.2.5 字符串和语言 8 (p1-2-6): 0.2.6 布尔逻辑 9 (p1-2-7): 0.2.7 数学名词汇总 10 (p1-3): 0.3 定义、定理和证明 12 (p1-4): 0.4 证明的类型 12 (p1-4-1): 0.4.1 构造性证明 13 (p1-4-2): 0.4.2 反证法 13 (p1-4-3): 0.4.3 归纳法 15 (p1-5): 练习 16 (p1-6): 问题 17 (p1-7): 习题选解 19 (p2): 第一部分自动机与语言 19 (p2-1): 第1章正则语言 19 (p2-1-1): 1.1 有穷自动机 21 (p2-1-1-1): 1.1.1 有穷自动机的形式化定义 22 (p2-1-1-2): 1.1.2 有穷自动机举例 24 (p2-1-1-3): 1.1.3 计算的形式化定义 24 (p2-1-1-4): 1.1.4 设计有穷自动机 26 (p2-1-1-5): 1.1.5 正则运算 28 (p2-1-2): 1.2 非确定性 31 (p2-1-2-1): 1.2.1 非确定型有穷自动机的形式化定义 32 (p2-1-2-2): 1.2.2 NFA与DFA的等价性 35 (p2-1-2-3): 1.2.3 在正则运算下的封闭性 37 (p2-1-3): 1.3 正则表达式 38 (p2-1-3-1): 1.3.1 正则表达式的形式化定义 39 (p2-1-3-2): 1.3.2 与有穷自动机的等价性 46 (p2-1-4): 1.4 非正则语言 50 (p2-1-5): 练习 54 (p2-1-6): 问题 58 (p2-1-7): 习题选解 63 (p2-2): 第2章上下文无关文法 63 (p2-2-1): 2.1 上下文无关文法概述 64 (p2-2-1-1): 2.1.1 上下文无关文法的形式化定义 65 (p2-2-1-2): 2.1.2 上下文无关文法举例 65 (p2-2-1-3): 2.1.3 设计上下文无关文法 66 (p2-2-1-4): 2.1.4 歧义性 67 (p2-2-1-5): 2.1.5 乔姆斯基范式 69 (p2-2-2): 2.2 下推自动机 70 (p2-2-2-1): 2.2.1 下推自动机的形式化定义 70 (p2-2-2-2): 2.2.2 下推自动机举例 72 (p2-2-2-3): 2.2.3 与上下文无关文法的等价性 76 (p2-2-3): 2.3 非上下文无关语言 79 (p2-2-4): 练习 81 (p2-2-5): 问题 83 (p2-2-6): 习题选解 87 (p3): 第二部分可计算性理论 87 (p3-1): 第3章丘奇-图灵论题 87 (p3-1-1): 3.1 图灵机 88 (p3-1-1-1): 3.1.1 图灵机的形式化定义 89 (p3-1-1-2): 3.1.2 图灵机的例子 93 (p3-1-2): 3.2 图灵机的变形 93 (p3-1-2-1): 3.2.1 多带图灵机 94 (p3-1-2-2): 3.2.2 非确定型图灵机 95 (p3-1-2-3): 3.2.3 枚举器 96 (p3-1-2-4): 3.2.4 与其他模型的等价性 97 (p3-1-3): 3.3 算法的定义 97 (p3-1-3-1): 3.3.1 希尔伯特问题 98 (p3-1-3-2): 3.3.2 描述图灵机的术语 100 (p3-1-4): 练习 101 (p3-1-5): 问题 102 (p3-1-6): 习题选解 104 (p3-2): 第4章可判定性 104 (p3-2-1): 4.1 可判定语言 104 (p3-2-1-1): 4.1.1 与正则语言相关的可判定性问题 106 (p3-2-1-2): 4.1.2 与上下文无关语言相关的可判定性问题 108 (p3-2-2): 4.2 停机问题 109 (p3-2-2-1): 4.2.1 对角化方法 111 (p3-2-2-2): 4.2.2 停机问题是不可判定的 113 (p3-2-2-3): 4.2.3 一个图灵不可识别语言 114 (p3-2-3): 练习 115 (p3-2-4): 问题 116 (p3-2-5): 习题选解 118 (p3-3): 第5章可归约性 118 (p3-3-1): 5.1 语言理论中的不可判定问题 124 (p3-3-2): 5.2 一个简单的不可判定问题 129 (p3-3-3): 5.3 映射可归约性 129 (p3-3-3-1): 5.3.1 可计算函数 129 (p3-3-3-2): 5.3.2 映射可归约性的形式定义 132 (p3-3-4): 练习 132 (p3-3-5): 问题 134 (p3-3-6): 习题选解 136 (p3-4): 第6章可计算性理论的高级专题 136 (p3-4-1): 6.1 递归定理 136 (p3-4-1-1): 6.1.1 自引用 138 (p3-4-1-2): 6.1.2 递归定理的术语 139 (p3-4-1-3): 6.1.3 应用 140 (p3-4-2): 6.2 逻辑理论的可判定性 141 (p3-4-2-1): 6.2.1 一个可判定的理论 143 (p3-4-2-2): 6.2.2 一个不可判定的理论 145 (p3-4-3): 6.3 图灵可归约性 146 (p3-4-4): 6.4 信息的定义 146 (p3-4-4-1): 6.4.1 极小长度的描述 148 (p3-4-4-2): 6.4.2 定义的优化 148 (p3-4-4-3): 6.4.3 不可压缩的串和随机性 150 (p3-4-5): 练习 150 (p3-4-6): 问题 151 (p3-4-7): 习题选解 153 (p4): 第三部分复杂性理论 153 (p4-1): 第7章时间复杂性 153 (p4-1-1): 7.1 度量复杂性 153 (p4-1-1-1): 7.1.1 大O和小o记法 155 (p4-1-1-2): 7.1.2 分析算法 157 (p4-1-1-3): 7.1.3 模型间的复杂性关系 158 (p4-1-2): 7.2 P类 158 (p4-1-2-1): 7.2.1 多项式时间 159 (p4-1-2-2): 7.2.2 P中的问题举例 163 (p4-1-3): 7.3 NP类 165 (p4-1-3-1): 7.3.1 NP中的问题举例 166 (p4-1-3-2): 7.3.2 P与NP问题 166 (p4-1-4): 7.4 NP完全性 167 (p4-1-4-1): 7.4.1 多项式时间可归约性 169 (p4-1-4-2): 7.4.2 NP完全性的定义 169 (p4-1-4-3): 7.4.3 库克-列文定理 173 (p4-1-5): 7.5 几个NP完全问题 174 (p4-1-5-1): 7.5.1 顶点覆盖问题 175 (p4-1-5-2): 7.5.2 哈密顿路径问题 178 (p4-1-5-3): 7.5.3 子集和问题 180 (p4-1-6): 练习 181 (p4-1-7): 问题 185 (p4-1-8): 习题选解 187 (p4-2): 第8章空间复杂性 188 (p4-2-1): 8.1 萨维奇定理 189 (p4-2-2): 8.2 PSPACE类 190 (p4-2-3): 8.3 PSPACE完全性 190 (p4-2-3-1): 8.3.1 TQBF问题 193 (p4-2-3-2): 8.3.2 博弈的必胜策略 194 (p4-2-3-3): 8.3.3 广义地理学 197 (p4-2-4): 8.4 L类和NL类 198 (p4-2-5): 8.5 NL完全性 200 (p4-2-6): 8.6 NL等于coNL 202 (p4-2-7): 练习 202 (p4-2-8): 问题 204 (p4-2-9): 习题选解 206 (p4-3): 第9章难解性 206 (p4-3-1): 9.1 层次定理 213 (p4-3-2): 9.2 相对化 215 (p4-3-3): 9.3 电路复杂性 220 (p4-3-4): 练习 221 (p4-3-5): 问题 222 (p4-3-6): 习题选解 223 (p4-4): 第10章复杂性理论高级专题 223 (p4-4-1): 10.1 近似算法 224 (p4-4-2): 10.2 概率算法 224 (p4-4-2-1): 10.2.1 BPP类 226 (p4-4-2-2): 10.2.2 素数性 229 (p4-4-2-3): 10.2.3 只读一次的分支程序 232 (p4-4-3): 10.3 交错式 233 (p4-4-3-1): 10.3.1 交错式时间与交错式空间 235 (p4-4-3-2): 10.3.2 多项式时间层次 236 (p4-4-4): 10.4 交互式证明系统 236 (p4-4-4-1): 10.4.1 图的非同构 237 (p4-4-4-2): 10.4.2 模型的定义 238 (p4-4-4-3): 10.4.3 IP=PSPACE 244 (p4-4-5): 10.5 并行计算 245 (p4-4-5-1): 10.5.1 一致布尔电路 246 (p4-4-5-2): 10.5.2 NC类 247 (p4-4-5-3): 10.5.3 P完全性 247 (p4-4-6): 10.6 密码学 248 (p4-4-6-1): 10.6.1 密钥 249 (p4-4-6-2): 10.6.2 公钥密码系统 249 (p4-4-6-3): 10.6.3 单向函数 250 (p4-4-6-4): 10.6.4 天窗函数 251 (p4-4-7): 练习 251 (p4-4-8): 问题 252 (p4-4-9): 习题选解 254 (p5): 参考文献 259 (p6): 索引

Chinese [zh] · PDF · 16.0MB · 2006 · 📗 Book (unknown) · 🚀/duxiu/zlibzh · Save

base score: 11063.0, final score: 0.17478916

duxiu/initial_release/10873306.zip

计算理论导论 : 英文版 = Introduction to the Theory of Computation (美)Michael Sipser著北京:机械工业出版社, Jing dian yuan ban shu ku, Jing dian yuan ban shu ku, Ying yin ban, Bei jing, China, 2002

1 (p1): 0 Introduction 1 (p1-2): 0.1 Automata,Computability,and Complexity 2 (p1-3): Complexity theory 2 (p1-4): Computability theory 3 (p1-5): Automata theory 3 (p1-6): 0.2 Mathematical Notions and Terminology 3 (p1-7): Sets 6 (p1-8): Sequences and tuples 7 (p1-9): Functions and relations 10 (p1-10): Graphs 13 (p1-11): Strings and languages 14 (p1-12): Boolean logic 16 (p1-13): Summary of mathematical terms 17 (p1-14): 0.3 Definitions,Theorems,and Proofs 17 (p1-15): Finding proofs 21 (p1-16): 0.4 Types of Proof 21 (p1-17): Proof by construction 21 (p1-18): Proof by contradiction 23 (p1-19): Proof by induction 25 (p1-20): Exercises and Problems 29 (p2): Part One:Automata and Languages 31 (p2-2): 1 Regular Languages 31 (p2-3): 1.1 Finite Automata 35 (p2-4): Formal definition of a finite automaton 37 (p2-5): Examples of finite automata 40 (p2-6): Formal definition of computation 41 (p2-7): Designing finite automata 44 (p2-8): The regular operations 47 (p2-9): 1.2 Nondeterminism 53 (p2-10): Formal definition of a nondeterministic finite automaton 54 (p2-11): Equivalence of NFAs and DFAs 58 (p2-12): Closure under the regular operations 63 (p2-13): 1.3 Regular Expressions 64 (p2-14): Formal definition ofa regular expression 66 (p2-15): Equivalence with finite automata 77 (p2-16): 1.4 Nonregular Languages 77 (p2-17): Thepumping lemma for regular languages 83 (p2-18): Exercises and Problems 91 (p2-19): 2 Context-Free Languages 92 (p2-20): 2.1 Context-free Grammars 94 (p2-21): Formal definition of a context-free grammar 95 (p2-22): Examples of context-free grammars 96 (p2-23): Designing context-free grammars 97 (p2-24): Ambiguity 98 (p2-25): Chomsky normal form 101 (p2-26): 2.2 Pushdown Automata 103 (p2-27): Formal definition of a pushdown automaton 104 (p2-28): Examples of pushdown automata 106 (p2-29): Equivalence with context-free grammars 115 (p2-30): The pumping lemma for context-free languages 115 (p2-31): 2.3 Non-context-free Languages 119 (p2-32): Exercises and Problems 123 (p3): Part Two:Computability Theory 125 (p3-2): 3 The Church-Turing Thesis 125 (p3-3): 3.1 Turing Machines 127 (p3-4): Formal definition of a Turing machine 130 (p3-5): Examples of Turing machines 136 (p3-6): 3.2 Variants of Turing Machines 136 (p3-7): Multitape Turing machines 138 (p3-8): Nondeterministic Turing machines 140 (p3-9): Enumerators 141 (p3-10): Equivalence with other models 142 (p3-11): 3.3 The Definition of Algorithm 142 (p3-12): Hilbert's problems 144 (p3-13): Terminology for describing Turing machines 147 (p3-14): Exercises and Problems 151 (p3-15): 4 Decidability 152 (p3-16): 4.1 Decidable Languages 152 (p3-17): Decidable problems concerning regular languages 156 (p3-18): Decidable problems concerning context-free languages 159 (p3-19): 4.2 The Halting Problem 160 (p3-20): The diagonalization method 165 (p3-21): The halting problem is undecidable 167 (p3-22): ATuring-unrecognizable language 168 (p3-23): Exercises and Problems 171 (p3-24): 5 Reducibility 172 (p3-25): 5.1 Undecidable Problems from Language Theory 176 (p3-26): Reductions via computation histories 183 (p3-27): 5.2 A Simple Undecidable Problem 189 (p3-28): 5.3 Mapping Reducibility 190 (p3-29): Computable functions 191 (p3-30): Formal definition ofmapping reducibility 195 (p3-31): Exercises and Problems 197 (p3-32): 6 Advanced Topics in Computability Theory 197 (p3-33): 6.1 The Recursion Theorem 198 (p3-34): Self-reference 201 (p3-35): Terminology for the recursion theorem 202 (p3-36): Applications 204 (p3-37): 6.2 Decidability of logical theories 206 (p3-38): A decidable theory 209 (p3-39): An undecidable theory 211 (p3-40): 6.3 Turing Reducibility 213 (p3-41): 6.4 A Definition of Information 214 (p3-42): Minimal length descriptions 217 (p3-43): Optimality of the definition 217 (p3-44): Incompressible strings and randomness 220 (p3-45): Exercises and Problems 223 (p4): Part Three:Complexity Theory 225 (p4-2): 7 Time Complexity 225 (p4-3): 7.1 Measuring Complexity 226 (p4-4): Big-O and small-o notation 229 (p4-5): Analyzing algorithms 231 (p4-6): Complexity relationships among models 234 (p4-7): 7.2 The Class P 234 (p4-8): Polynomial time 236 (p4-9): Examples of problems in P 241 (p4-10): 7.3 The Class NP 245 (p4-11): Examples of problemsin NP 247 (p4-12): The P versus NP question 248 (p4-13): 7.4 NP-completeness 249 (p4-14): Polynomial time reducibility 253 (p4-15): Definition of NP-completeness 254 (p4-16): The Cook-Levin Theorem 260 (p4-17): 7.5 Additional NP-complete Problems 261 (p4-18): The vertex cover problem 262 (p4-19): The Hamiltonian path problem 268 (p4-20): The subset sum problem 271 (p4-21): Exercises and Problems 277 (p4-22): 8 Space Complexity 279 (p4-23): 8.1 Savitch's Theorem 281 (p4-24): 8.2 The Class PSPACE 283 (p4-25): The TQBF problem 283 (p4-26): 8.3 PSPACE-completeness 287 (p4-27): Winning strategies for games 289 (p4-28): Generalized geography 294 (p4-29): 8.4 The Classes L and NL 297 (p4-30): 8.5 NL-completeness 298 (p4-31): Searching in graphs 300 (p4-32): 8.6 NL equals coNL 302 (p4-33): Exercises and Problems 305 (p4-34): 9 Intractability 306 (p4-35): 9.1 Hierarchy Theorems 313 (p4-36): Exponential space completeness 318 (p4-37): 9.2 Relativization 319 (p4-38): Limits of the diagonalization method 321 (p4-39): 9.3 Circuit Complexity 330 (p4-40): Exercises and Problems 333 (p4-41): 10 Advanced topics in complexity theory 333 (p4-42): 10.1 Approximation Algorithms 335 (p4-43): 10.2 Probabilistic Algorithms 336 (p4-44): The class BPP 339 (p4-45): Primality 343 (p4-46): Read-once branching programs 348 (p4-47): 10.3 Alternation 349 (p4-48): Alternating time and space 353 (p4-49): The Polynomial time hierarchy 354 (p4-50): 10.4 Interactive Proof Systems 355 (p4-51): Graph nonisomorphism 355 (p4-52): Definition of the model 357 (p4-53): IP=PSPACE 366 (p4-54): 10.5 Parallel Computation 367 (p4-55): Uniform Boolean circuits 369 (p4-56): The class NC 371 (p4-57): P-completeness 372 (p4-58): 10.6 Cryptography 372 (p4-59): Secret keys 374 (p4-60): Public-key cryptosystems 374 (p4-61): One-way functions 376 (p4-62): Trapdoor functions 378 (p4-63): Exercises and Problems 381 (p4-64): Selected Bibliography 387 (p4-65): Index

Chinese [zh] · PDF · 13.3MB · 2002 · 📗 Book (unknown) · 🚀/duxiu · Save

base score: 11063.0, final score: 0.1746906

duxiu/initial_release/40539907.zip

计算理论导论 : 英文版 = Introduction to the Theory of Computation MICHAEL SIPSER CHINA MACHINE PRESS, Jing dian yuan ban shu ku, Jing dian yuan ban shu ku, Ying yin ban, Bei jing, China, 2002

Chinese [zh] · PDF · 109.2MB · 2002 · 📗 Book (unknown) · 🚀/duxiu · Save

base score: 11060.0, final score: 0.17467602

19 partial matches

lgli/Wprowadzenie do teorii obliczeń (2020, PWN) - Michael Sipser.epub

Wprowadzenie do teorii obliczeń Michael Sipser. PWN, Wydawnictwo Naukowe, 2020

Wprowadzenie do teorii obliczeń to najpopularniejszy podręcznik do teorii obliczeń. Dotyczy podstaw informatyki, a w szczególności możliwości obliczeniowych współczesnych komputerów. Książka składa się z trzech części. Pierwsza jest poświęcona automatom i językom formalnym. Omówiono w niej niedeterminizm, równoważność automatów deterministycznych i niedeterministycznych, wyrażenia regularne, kryteria nieregularności języków, a także języki bezkontekstowe. Druga część dotyczy teorii obliczalności. Opisano w niej ograniczenia współczesnych komputerów, wyjaśniono pojęcia rozstrzygalności i nierozstrzygalności. Trzecia część jest poświęcona teorii złożoności. Przedstawiono w niej podstawowe klasy złożoności obliczeniowej, klasę problemów NP-zupełnych, a także klasyfikację problemów ze względu na możliwość automatycznego ich rozwiązywania przy ograniczonych zasobach. Trzecia edycja zawiera zupełnie nowy podrozdział poświęcony deterministycznym językom bezkontekstowym. Została też wzbogacona o nowe ćwiczenia, problemy i przykłady. Książka skierowana do studentów informatyki na wszystkich wyższych uczelniach.

Polish [pl] · EPUB · 3.5MB · 2020 · 📘 Book (non-fiction) · 🚀/lgli/lgrs · Save

base score: 11060.0, final score: 35.659637

lgli/Michael Sipser - Introduction to the Theory of Computation, 3rd ed. (2012, ).pdf

Introduction to the Theory of Computation, 3rd ed. Michael Sipser 2012

English [en] · PDF · 26.1MB · 2012 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

base score: 11063.0, final score: 32.666275

lgli/Sipser, Michael (2013).pdf

Introduction to the Theory of Computation Michael Sipser Course Technology Cengage Learning, 3. ed., internat. ed, Erscheinungsort nicht ermittelbar, 2013

English [en] · PDF · 3.9MB · 2013 · 📘 Book (non-fiction) · 🚀/lgli/lgrs · Save

base score: 11065.0, final score: 31.726568

nexusstc/计算理论导引: 原书第3版/2aaf244f7c8ed73a881543667f1d7b6d.pdf

计算理论导引: 原书第3版迈克尔·西普塞 (Michael Sipser) 机械工业出版社, 计算机科学丛书, 2015

书签已装载, 书签制作方法请找 yjyouaremysunshine@163.com 完全免费《计算理论导引(原书第3版)》由计算理论领域的知名权威 Michael Sipser 所撰写。他以独特的视角,系统地介绍了计算理论的三个主要内容:自动机与语言、可计算性理论和计算复杂性理论。作者以清新的笔触、生动的语言给出了宽泛的数学原理,而没有拘泥于某些低层次的细节。在证明之前,均有“证明思路”,帮助读者理解数学形式下蕴涵的概念。本书可作为计算机专业高年级本科生和研究生的教材,也可作为教师和研究人员的参考书。

Chinese [zh] · PDF · 162.5MB · 2015 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11060.0, final score: 30.639133

nexusstc/计算理论导引/c6a720544fd059e66a79547c10af5e16.pdf

计算理论导引 = Introduction to the theory of computation (美)Michael Sipser著 ; 唐常杰[等]译; 西普塞; 唐常杰机械工业出版社, 计算机科学丛书, 2, 2006

译者还有:陈鹏,向勇,刘齐宏

Chinese [zh] · PDF · 7.4MB · 2006 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11060.0, final score: 29.68926

Wprowadzenie do teorii obliczeń Michael Sipser. Wydawnictwo Naukowe PWN, 2020

Polish [pl] · EPUB · 3.5MB · 2020 · 📗 Book (unknown) · 🚀/zlib · Save

base score: 11057.0, final score: 29.472027

lgli/dvd44/Law C., Lee E.K., Ramzan Z. - Introduction to the Theory of Computation(1999)(56).pdf

Instructor's Manual for Sipser's Introduction to the Theory of Computation Ching Law, Edmond K. Lee, Zulfikar Ramzan,Michael Sipser Brooks-Cole, Instructor's manual for sipser's 1, 1999

English [en] · PDF · 17.7MB · 1999 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save

base score: 11062.0, final score: 28.593363

ia/isbn_9787111499718.pdf

计算理论导引 = Introduction to the theory of computation (美)迈克尔. 西普塞(Michael Sipser)著 ; 段磊, 唐常杰等译; 西普塞; 段磊; 唐常杰机械工业出版社, Ji suan ji ke xue cong shu, Di 1 ban, Beijing, 2015

本书系统地介绍了计算理论的三个主要内容: 自动机与语言, 可计算性理论和计算复杂性理论.作者以清新的笔触, 生动的语言给出了宽泛的数学原理, 而没有拘泥于某些低层次的细节

Chinese [zh] · English [en] · PDF · 45.4MB · 2015 · 📗 Book (unknown) · 🚀/ia · Save

base score: 11068.0, final score: 28.122103

duxiu/initial_release/10331769.zip

计算理论导引 Ji suan li lun dao yin (美)西普塞(Michael Sipser)著;张立昂等译, (美)西普塞(Michael Sipser)著 , 张立昂等译, 西普塞, Michael Sipser, 张立昂, (美)Michael Sipser著 , 张立昂等译, 西普塞, Pser Si, 张立昂, Pusai Xi, Pser Si, Liang Zhang 北京:机械工业出版社, 2000, 2000

1 (p0-1): 译者序 1 (p0-2): 前言 1 (p1): 第1章导引 1 (p1-2): 1.1 自动机、可计算与复杂性 1 (p1-3): 1.1.1 计算复杂性理论 2 (p1-4): 1.1.2 可计算性理论 2 (p1-5): 1.1.3 自动机理论 2 (p1-6): 1.2 数学概念和术语 2 (p1-7): 1.2.1 集合 3 (p1-8): 1.2.2 序列和多元组 4 (p1-9): 1.2.3 函数和关系 6 (p1-10): 1.2.4 图 8 (p1-11): 1.2.5 字符串和语言 8 (p1-12): 1.2.6 布尔逻辑 9 (p1-13): 1.2.7 数学名词汇总 10 (p1-14): 1.3 定义、定理和证明 13 (p1-15): 1.4 证明和类型 13 (p1-16): 1.4.1 构造性证明 13 (p1-17): 1.4.2 反证法 14 (p1-18): 1.4.3 归纳法 16 (p1-19): 练习 17 (p1-20): 问题 19 (p2): 第一部分自动机与语言 19 (p2-2): 第2章正则语言 19 (p2-3): 2.1 有穷自动机 21 (p2-4): 2.1.1 有穷自动机的形式定义 22 (p2-5): 2.1.2 有穷自动机举例 24 (p2-6): 2.1.3 计算的形式定义 24 (p2-7): 2.1.4 设计有穷自动机 26 (p2-8): 2.1.5 正则运算 28 (p2-9): 2.2 非确定性 32 (p2-10): 2.2.1 非确定型有穷自动机的形式定义 33 (p2-11): 2.2.2 NFA与DFA的等价性 35 (p2-12): 2.2.3 在正则运算下的封闭性 38 (p2-13): 2.3 正则表达式 39 (p2-14): 2.3.1 正则表达式的形式定义 40 (p2-15): 2.3.2 与有穷自动机的等价性 47 (p2-16): 2.4 非正则语言 51 (p2-17): 练习 55 (p2-18): 问题 59 (p2-19): 3.1 上下文无关文法 59 (p2-20): 第3章上下文无关语言 61 (p2-21): 3.1.1 上下文无关文法的形式定义 61 (p2-22): 3.1.2 上下文无关文法举例 62 (p2-23): 3.1.3 设计上下文无关文法 63 (p2-24): 3.1.4 歧义性 64 (p2-25): 3.1.5 乔姆斯基范式 66 (p2-26): 3.2 下推自动机 67 (p2-27): 3.2.1 下推自动机的形式定义 67 (p2-28): 3.2.2 下推自动机举例 69 (p2-29): 3.2.3 与上下文无关文法的等价性 74 (p2-30): 3.3 非上下文无关语言 77 (p2-31): 练习 79 (p2-32): 问题 81 (p3): 第二部分可计算性理论 81 (p3-2): 第4章丘奇--图灵论题 81 (p3-3): 4.1 图灵机 82 (p3-4): 4.1.1 图灵机的形式定义 84 (p3-5): 4.1.2 图灵机的例子 88 (p3-6): 4.2 图灵机的变形 88 (p3-7): 4.2.1 多带图灵机 89 (p3-8): 4.2.2 非确定型图灵机 91 (p3-9): 4.2.3 枚举器 92 (p3-10): 4.3 算法的定义 92 (p3-11): 4.3.1 希尔伯特问题 92 (p3-12): 4.2.4 与其他模型的等价性 94 (p3-13): 4.3.2 描述图灵机的术语 96 (p3-14): 练习 97 (p3-15): 问题 99 (p3-16): 第5章可判定性 99 (p3-17): 5.1 可判定语言 99 (p3-18): 5.1.1 与正则语言相关的可判定性问题 101 (p3-19): 5.1.2 与上下文无关语言相关的可判定问题 104 (p3-20): 5.2.1 对角化方法 104 (p3-21): 5.2 停机问题 107 (p3-22): 5.2.2 停机问题是不可判定的 109 (p3-23): 5.2.3 一个图灵不可识别语言 110 (p3-24): 练习 111 (p3-25): 问题 112 (p3-26): 第6章可归约性 112 (p3-27): 6.1 语言理论中的不可判定问题 119 (p3-28): 6.2 一个简单的不可判定问题 123 (p3-29): 6.3 映射可归约性 124 (p3-30): 6.3.2 映射可归约性的形式定义 124 (p3-31): 6.3.1 可计算函数 127 (p3-32): 练习 127 (p3-33): 问题 129 (p3-34): 第7章可计算性理论的高级专题 129 (p3-35): 7.1 递归定理 129 (p3-36): 7.1.1 自引用 131 (p3-37): 7.1.2 应用递归定理的术语 132 (p3-38): 7.1.3 应用 133 (p3-39): 7.2 逻辑理论的可判定性 135 (p3-40): 7.2.1 一个可判定的理论 137 (p3-41): 7.2.2 一个不可判定的理论 138 (p3-42): 7.3 图灵可归约性 139 (p3-43): 7.4 信息的定义 140 (p3-44): 7.4.1 极小长度的描述 142 (p3-45): 7.4.2 定义的优化 142 (p3-46): 7.4.3 不可压缩的串和随机性 144 (p3-47): 练习 144 (p3-48): 问题 147 (p3-49): 8.1 度量复杂性 147 (p3-50): 8.1.1 大O和小o记法 147 (p3-51): 第8章时间复杂性 147 (p4): 第三部分复杂性理论 149 (p4-2): 8.1.2 分析算法 151 (p4-3): 8.1.3 模型间的复杂性关系 153 (p4-4): 8.2 P类 153 (p4-5): 8.2.1 多项式时间 154 (p4-6): 8.2.2 P中的问题举例 157 (p4-7): 8.3 NP类 160 (p4-8): 8.3.1 NP中的问题举例 161 (p4-9): 8.4 NP完全性 161 (p4-10): 8.3.2 P与NP问题 162 (p4-11): 8.4.1 多项式时间可归约性 164 (p4-12): 8.4.2 NP完全性的定义 165 (p4-13): 8.4.3 库克--列文定理 169 (p4-14): 8.5 几个NP完全问题 169 (p4-15): 8.5.1 顶点覆盖问题 170 (p4-16): 8.5.2 哈密顿路径问题 174 (p4-17): 8.5.3 子集和问题 176 (p4-18): 练习 177 (p4-19): 问题 181 (p4-20): 第9章空间复杂性 182 (p4-21): 9.1 萨维奇定理 183 (p4-22): 9.2 PSPACE类 184 (p4-23): 9.3 PSPACE完全性 185 (p4-24): 9.3.1 问题TQBF 187 (p4-25): 9.3.2 博奕的必胜策略 188 (p4-26): 9.3.3 广义地理学 192 (p4-27): 9.4 L类和NL类 193 (p4-28): 9.5 NL完全性 195 (p4-29): 9.6 NL等于coNL 197 (p4-30): 练习 197 (p4-31): 问题 200 (p4-32): 10.1 层次定理 200 (p4-33): 第10章难解性 208 (p4-34): 10.2 相对化 211 (p4-35): 10.3 电路复杂性 216 (p4-36): 练习 217 (p4-37): 问题 219 (p4-38): 第11章复杂性理论中的高级专题 219 (p4-39): 11.1 近似算法 220 (p4-40): 11.2 概率算法 220 (p4-41): 11.2.1 BPP类 223 (p4-42): 11.2.2 素数性 226 (p4-43): 11.2.3 只读一次的分支程序 229 (p4-44): 11.3 交错式 229 (p4-45): 11.3.1 交错式时间与交错式空间 232 (p4-46): 11.3.2 多项式时间层次 232 (p4-47): 11.4 交互式证明系统 233 (p4-48): 11.4.1 图的非同构 233 (p4-49): 11.4.2 模型的定义 234 (p4-50): 11.4.3 IP=PSPACE 242 (p4-51): 11.5 并行计算 242 (p4-52): 11.5.1 一致布尔电路 243 (p4-53): 11.5.2 NC类 245 (p4-54): 11.5.3 P完全性 245 (p4-55): 11.6 密码学 245 (p4-56): 11.6.1 密钥 247 (p4-57): 11.6.2 公钥密码系统 247 (p4-58): 11.6.3 单向函数 248 (p4-59): 11.6.4 天窗函数 249 (p4-60): 练习 249 (p4-61): 问题 251 (p4-62): 参考文献 255 (p4-63): 索引

Chinese [zh] · PDF · 12.6MB · 2000 · 📗 Book (unknown) · 🚀/duxiu/zlibzh · Save

base score: 11060.0, final score: 27.714716

lgli/Michael Sipser - Introduction to the Theory of Computation (2012, CENGAGE).pdf

Introduction to the Theory of Computation Michael Sipser Course Technology Cengage Learning, 3, 2012

English [en] · PDF · 5.3MB · 2012 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

base score: 11068.0, final score: 27.447046

nexusstc/计算理论导引原书第3版/f4e0014efeedc28573b4afc2b9651a05.pdf

计算理论导引原书第3版 (美)迈克尔. 西普塞(Michael Sipser)著 ; 段磊, 唐常杰等译; 西普塞; 段磊; 唐常杰机械工业出版社, Ji suan ji ke xue cong shu, Di 1 ban, Beijing, 2015

Chinese [zh] · PDF · 45.8MB · 2015 · 📘 Book (non-fiction) · 🚀/nexusstc/zlib · Save

base score: 11060.0, final score: 27.447046

lgli/Michael Sipser - Introduction to the Theory of Computation, Third Edition (2013, Cengage Learning).pdf

Introduction to the Theory of Computation, Third Edition Michael Sipser Course Technology Cengage Learning, 3. ed., internat. ed, Erscheinungsort nicht ermittelbar, 2013

English [en] · PDF · 73.4MB · 2013 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

base score: 11068.0, final score: 27.268013

upload/duxiu_main2/【星空藏书馆】/图书馆8号/读秀国家图书馆/读秀书库【08】/图书分类/【V2---博哥纪录片社群】1号盘等多个文件/计算机网络/汇总/形式语言与自动机_计算理论/计算理论导引_Sipser/计算理论导引（Sipser）英文版.pdf

计算理论导论 Sipser

听雨尘心 http://realking1980.blogchina.com

PDF · 8.3MB · 📗 Book (unknown) · 🚀/upload · Save

base score: 10954.0, final score: 26.698673

lgli/Michael Sipser - Introdução à Teoria da Computação.pdf

Introdução à Teoria da Computação Michael Sipser Cengage Learning, 2o EDIÇÃO

Esta obra apresenta a teoria da computação por meio de teoremas e provas, sempre com a preocupação do autor em mostrar a intuição por trás de cada resultado e em amenizar a leitura destas últimas, apresentando, para cada teorema, uma ideia da prova. Com este livro, através da prática de resolução de problemas, os alunos, nos exercícios, revisarão definições e conceitos da área e, nos problemas, irão se deparar com atividades que exigem maior engenhosidade. Os três últimos capítulos são novos, e esta 2a edição incorpora as sugestões de professores e alunos enviadas ao autor ao longo dos anos. Contém material para mais de um semestre de curso, propiciando flexibilidade para escolha de tópicos a serem mais ou menos explorados.

Portuguese [pt] · PDF · 21.6MB · 2005 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

base score: 11063.0, final score: 26.386185

duxiu/initial_release/13797916.zip

计算理论导引原书第3版 (美)迈克尔·西普塞(MichaelSipser)著;段磊,唐常杰等译, (美)迈克尔. 西普塞(Michael Sipser)著 , 段磊, 唐常杰等译, 西普塞, 段磊, 唐常杰, 西普塞 (Sipser, Michael) 北京:机械工业出版社, 2015, 2015

1 (p1): 第0章绪论 1 (p1-1): 0.1自动机、可计算性与复杂性 1 (p1-1-1): 0.1.1计算复杂性理论 2 (p1-1-2): 0.1.2可计算性理论 2 (p1-1-3): 0.1.3自动机理论 2 (p1-2): 0.2数学概念和术语 2 (p1-2-1): 0.2.1集合 4 (p1-2-2): 0.2.2序列和多元组 4 (p1-2-3): 0.2.3函数和关系 6 (p1-2-4): 0.2.4图 8 (p1-2-5): 0.2.5字符串和语言 9 (p1-2-6): 0.2.6布尔逻辑 10 (p1-2-7): 0.2.7数学名词汇总 11 (p1-3): 0.3定义、定理和证明 13 (p1-4): 0.4证明的类型 13 (p1-4-1): 0.4.1构造性证明 14 (p1-4-2): 0.4.2反证法 15 (p1-4-3): 0.4.3归纳法 16 (p1-5): 练习 17 (p1-6): 问题 18 (p1-7): 习题选解 20 (p2): 第一部分自动机与语言 20 (p2-1): 第1章正则语言 20 (p2-1-1): 1.1有穷自动机 22 (p2-1-1-1): 1.1.1有穷自动机的形式化定义 23 (p2-1-1-2): 1.1.2有穷自动机举例 25 (p2-1-1-3): 1.1.3计算的形式化定义 25 (p2-1-1-4): 1.1.4设计有穷自动机 27 (p2-1-1-5): 1.1.5正则运算 29 (p2-1-2): 1.2非确定性 32 (p2-1-2-1): 1.2.1非确定型有穷自动机的形式化定义 33 (p2-1-2-2): 1.2.2 NFA与DFA的等价性 36 (p2-1-2-3): 1.2.3在正则运算下的封闭性 38 (p2-1-3): 1.3正则表达式 38 (p2-1-3-1): 1.3.1正则表达式的形式化定义 40 (p2-1-3-2): 1.3.2与有穷自动机的等价性 46 (p2-1-4): 1.4非正则语言 50 (p2-1-5): 练习 54 (p2-1-6): 问题 58 (p2-1-7): 习题选解 62 (p2-2): 第2章上下文无关文法 62 (p2-2-1): 2.1上下文无关文法概述 63 (p2-2-1-1): 2.1.1上下文无关文法的形式化定义 64 (p2-2-1-2): 2.1.2上下文无关文法举例 65 (p2-2-1-3): 2.1.3设计上下文无关文法 66 (p2-2-1-4): 2.1.4歧义性 67 (p2-2-1-5): 2.1.5乔姆斯基范式 68 (p2-2-2): 2.2下推自动机 69 (p2-2-2-1): 2.2.1下推自动机的形式化定义 70 (p2-2-2-2): 2.2.2下推自动机举例 72 (p2-2-2-3): 2.2.3与上下文无关文法的等价性 77 (p2-2-3): 2.3非上下文无关语言 79 (p2-2-4): 2.4确定型上下文无关语言 82 (p2-2-4-1): 2.4.1 DCFL的性质 83 (p2-2-4-2): 2.4.2确定型上下文无关文法 91 (p2-2-4-3): 2.4.3 DPDA和DCFG的关系 94 (p2-2-4-4): 2.4.4语法分析和LR（k）文法 96 (p2-2-5): 练习 98 (p2-2-6): 问题 100 (p2-2-7): 习题选解 104 (p3): 第二部分可计算性理论 104 (p3-1): 第3章丘奇-图灵论题 104 (p3-1-1): 3.1图灵机 105 (p3-1-1-1): 3.1.1图灵机的形式化定义 107 (p3-1-1-2): 3.1.2图灵机的例子 110 (p3-1-2): 3.2图灵机的变形 111 (p3-1-2-1): 3.2.1多带图灵机 112 (p3-1-2-2): 3.2.2非确定型图灵机 113 (p3-1-2-3): 3.2.3枚举器 114 (p3-1-2-4): 3.2.4与其他模型的等价性 114 (p3-1-3): 3.3算法的定义 115 (p3-1-3-1): 3.3.1希尔伯特问题 116 (p3-1-3-2): 3.3.2描述图灵机的术语 118 (p3-1-4): 练习 119 (p3-1-5): 问题 120 (p3-1-6): 习题选解 122 (p3-2): 第4章可判定性 122 (p3-2-1): 4.1可判定语言 122 (p3-2-1-1): 4.1.1与正则语言相关的可判定性问题 124 (p3-2-1-2): 4.1.2与上下文无关语言相关的可判定性问题 126 (p3-2-2): 4.2不可判定性 127 (p3-2-2-1): 4.2.1对角化方法 130 (p3-2-2-2): 4.2.2不可判定语言 131 (p3-2-2-3): 4.2.3一个图灵不可识别语言 132 (p3-2-3): 练习 133 (p3-2-4): 问题 134 (p3-2-5): 习题选解 136 (p3-3): 第5章可归约性 136 (p3-3-1): 5.1语言理论中的不可判定问题 143 (p3-3-2): 5.2一个简单的不可判定问题 148 (p3-3-3): 5.3映射可归约性 148 (p3-3-3-1): 5.3.1可计算函数 148 (p3-3-3-2): 5.3.2映射可归约性的形式化定义 151 (p3-3-4): 练习 151 (p3-3-5): 问题 153 (p3-3-6): 习题选解 155 (p3-4): 第6章可计算性理论的高级专题 155 (p3-4-1): 6.1递归定理 155 (p3-4-1-1): 6.1.1自引用 157 (p3-4-1-2): 6.1.2递归定理的术语 158 (p3-4-1-3): 6.1.3应用 159 (p3-4-2): 6.2逻辑理论的可判定性 161 (p3-4-2-1): 6.2.1一个可判定的理论 163 (p3-4-2-2): 6.2.2一个不可判定的理论 164 (p3-4-3): 6.3图灵可归约性 165 (p3-4-4): 6.4信息的定义 166 (p3-4-4-1): 6.4.1极小长度的描述 168 (p3-4-4-2): 6.4.2定义的优化 168 (p3-4-4-3): 6.4.3不可压缩的串和随机性 170 (p3-4-5): 练习 170 (p3-4-6): 问题 171 (p3-4-7): 习题选解 174 (p4): 第三部分复杂性理论 174 (p4-1): 第7章时间复杂性 174 (p4-1-1): 7.1度量复杂性 174 (p4-1-1-1): 7.1.1大O和小o记法 176 (p4-1-1-2): 7.1.2分析算法 178 (p4-1-1-3): 7.1.3模型间的复杂性关系 180 (p4-1-2): 7.2 P类 180 (p4-1-2-1): 7.2.1多项式时间 181 (p4-1-2-2): 7.2.2 P中的问题举例 184 (p4-1-3): 7.3 NP类 187 (p4-1-3-1): 7.3.1 NP中的问题举例 188 (p4-1-3-2): 7.3.2 P与NP问题 188 (p4-1-4): 7.4 NP完全性 189 (p4-1-4-1): 7.4.1多项式时间可归约性 191 (p4-1-4-2): 7.4.2 NP完全性的定义 192 (p4-1-4-3): 7.4.3库克-列文定理 196 (p4-1-5): 7.5几个NP完全问题 196 (p4-1-5-1): 7.5.1顶点覆盖问题 198 (p4-1-5-2): 7.5.2哈密顿路径问题 201 (p4-1-5-3): 7.5.3子集和问题 202 (p4-1-6): 练习 203 (p4-1-7): 问题 207 (p4-1-8): 习题选解 208 (p4-2): 第8章空间复杂性 209 (p4-2-1): 8.1萨维奇定理 210 (p4-2-2): 8.2 PSPACE类 211 (p4-2-3): 8.3 PSPACE完全性 212 (p4-2-3-1): 8.3.1 TQBF问题 214 (p4-2-3-2): 8.3.2博弈的必胜策略 215 (p4-2-3-3): 8.3.3广义地理学 219 (p4-2-4): 8.4 L类和NL类 220 (p4-2-5): 8.5 N L完全性 222 (p4-2-6): 8.6 NL等于coNL 224 (p4-2-7): 练习 224 (p4-2-8): 问题 226 (p4-2-9): 习题选解 228 (p4-3): 第9章难解性 228 (p4-3-1): 9.1层次定理 236 (p4-3-2): 9.2相对化 238 (p4-3-3): 9.3电路复杂性 244 (p4-3-4): 练习 245 (p4-3-5): 问题 245 (p4-3-6): 习题选解 247 (p4-4): 第10章复杂性理论高级专题 247 (p4-4-1): 10.1近似算法 248 (p4-4-2): 10.2概率算法 249 (p4-4-2-1): 10.2.1 BPP类 250 (p4-4-2-2): 10.2.2素数性 254 (p4-4-2-3): 10.2.3只读一次的分支程序 257 (p4-4-3): 10.3交错式 257 (p4-4-3-1): 10.3.1交错式时间与交错式空间 260 (p4-4-3-2): 10.3.2多项式时间层次 260 (p4-4-4): 10.4交互式证明系统 261 (p4-4-4-1): 10.4.1图的非同构 261 (p4-4-4-2): 10.4.2模型的定义 263 (p4-4-4-3): 10.4.3 IP= PSPACE 270 (p4-4-5): 10.5并行计算 270 (p4-4-5-1): 10.5.1一致布尔电路 272 (p4-4-5-2): 10.5.2 NC类 273 (p4-4-5-3): 10.5.3 P完全性 273 (p4-4-6): 10.6密码学 274 (p4-4-6-1): 10.6.1密钥 275 (p4-4-6-2): 10.6.2公钥密码系统 275 (p4-4-6-3): 10.6.3单向函数 277 (p4-4-6-4): 10.6.4天窗函数 277 (p4-4-7): 练习 278 (p4-4-8): 问题 278 (p4-4-9): 习题选解 280 (p5): 参考文献 284 (p6): 索引

Chinese [zh] · PDF · 166.5MB · 2015 · 📗 Book (unknown) · 🚀/duxiu/zlibzh · Save

base score: 11060.0, final score: 25.65215