| 《自动机理论与应用(影印版)》：大学计算机教育国外著名教材系列 |
| preface acknowledgments credits part ⅰ introduction 1 why study the theory of computation? 2 languages and strings 3 the big picture: a language hierarchy 4 computation part ⅱ finite state machines and regular languages 5 finite state machines 6 regular expressions 7 regular grammars 8 regular and nonregular languages 9 algorithms and decision procedures for regualr languages 10 summary and reference part ⅲ context-free languages and pushdown automata 11 context-free grammars 12 rushdown automata 13 context-free and noncontext-free languages 14 algorithms and decision procedures for context-free languages 15 context-free parsing 16 summary and references part ⅳ turing machines and undecidability 17 turing machines 18 the church-turing thesis 19 the church-turing thesis 20 decidable and semidecidable languages 21 decidability and undecidability proofs …… part ⅴ complexity appendices appendices g-q: applications |
内容加载中，请稍后...
商品评论（0条）