رکورد قبلیرکورد بعدی

" Computability, complexity, and languages : "


Document Type : BL
Record Number : 713052
Doc. No : b535241
Main Entry : Davis, Martin,1928-
Title & Author : Computability, complexity, and languages : : fundamentals of theoretical computer science /\ Martin D. Davis, Ron Sigal, Elaine J. Weyuker
Edition Statement : 2nd ed
Publication Statement : Boston :: Academic Press, Harcourt, Brace,, 1994
Series Statement : Computer science and scientific computing
Page. NO : xix, 609 pages :: illustrations ;; 24 cm
ISBN : 0122063821
: : 9780122063824
Bibliographies/Indexes : Includes bibliographical references (pages 593-594) and index
Contents : 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
Abstract : 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
Subject : Computational complexity
Subject : Formal languages
Subject : Machine theory
Dewey Classification : ‭511.3‬
LC Classification : ‭QA267‬‭.D38 1994‬
Added Entry : Sigal, Ron
: Weyuker, Elaine J
کپی لینک

پیشنهاد خرید
پیوستها
Search result is zero
نظرسنجی
نظرسنجی منابع دیجیتال

1 - آیا از کیفیت منابع دیجیتال راضی هستید؟