عنوان
پدید آورنده
موضوع
رده
QA267 .D38 1994
QA267
.
D38
1994
کتابخانه
محل استقرار
0122063821
9780122063824
b535241
Computability, complexity, and languages :
[Book]
fundamentals of theoretical computer science /
Martin D. Davis, Ron Sigal, Elaine J. Weyuker
2nd ed
Boston :
Academic Press, Harcourt, Brace,
1994
xix, 609 pages :
illustrations ;
24 cm
Computer science and scientific computing
Includes bibliographical references (pages 593-594) and index
pt. 1. Computability -- 1. Preliminaries -- 2. Programs and computable functions -- 3. Primitive rescursive functions -- 4. A universal program -- 5. Calculations on strings -- 6. Turing machines -- 7. Processes and grammars -- 8. Classifying unsolvable problems
pt. 2. Grammars and automata -- 9. Regular languages -- 10. Context-free languages -- 11. Context-sensitive languages
pt. 3. Logic -- 12. Propositional calculus -- 13. Quantification theory
pt. 4. Complexity -- 14. Abstract complexity -- 15. Polynomial -- time computability
pt. 5. Semantics -- 16. Approximation orderings -- 17. Denotational semantics of recursion equations -- 18. Operational semantics of recursion equations
0
0
0
0
0
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability
Computational complexity
Formal languages
Machine theory
511
.
3
20
QA267
.
D38
1994
Davis, Martin,1928-
Sigal, Ron
Weyuker, Elaine J
20150422101950.0
مطالعه متن کتاب [Book]
Y
