• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
Computability, complexity, and languages :

پدید آورنده
Martin D. Davis, Ron Sigal, Elaine J. Weyuker

موضوع
Computational complexity,Formal languages,Machine theory

رده
QA267
.
D38
1994

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
0122063821
(Number (ISBN
9780122063824

NATIONAL BIBLIOGRAPHY NUMBER

Number
b535241

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Computability, complexity, and languages :
General Material Designation
[Book]
Other Title Information
fundamentals of theoretical computer science /
First Statement of Responsibility
Martin D. Davis, Ron Sigal, Elaine J. Weyuker

EDITION STATEMENT

Edition Statement
2nd ed

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Boston :
Name of Publisher, Distributor, etc.
Academic Press, Harcourt, Brace,
Date of Publication, Distribution, etc.
1994

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
xix, 609 pages :
Other Physical Details
illustrations ;
Dimensions
24 cm

SERIES

Series Title
Computer science and scientific computing

INTERNAL BIBLIOGRAPHIES/INDEXES NOTE

Text of Note
Includes bibliographical references (pages 593-594) and index

CONTENTS NOTE

Text of Note
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
Text of Note
pt. 2. Grammars and automata -- 9. Regular languages -- 10. Context-free languages -- 11. Context-sensitive languages
Text of Note
pt. 3. Logic -- 12. Propositional calculus -- 13. Quantification theory
Text of Note
pt. 4. Complexity -- 14. Abstract complexity -- 15. Polynomial -- time computability
Text of Note
pt. 5. Semantics -- 16. Approximation orderings -- 17. Denotational semantics of recursion equations -- 18. Operational semantics of recursion equations
0
0
0
0
0

SUMMARY OR ABSTRACT

Text of Note
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

TOPICAL NAME USED AS SUBJECT

Computational complexity
Formal languages
Machine theory

DEWEY DECIMAL CLASSIFICATION

Number
511
.
3
Edition
20

LIBRARY OF CONGRESS CLASSIFICATION

Class number
QA267
Book number
.
D38
1994

PERSONAL NAME - PRIMARY RESPONSIBILITY

Davis, Martin,1928-

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Sigal, Ron
Weyuker, Elaine J

ORIGINATING SOURCE

Date of Transaction
20150422101950.0

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival