MARC details
| 000 -LEADER |
|---|
| fixed length control field |
04854nam a22004815i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
978-1-84882-497-3 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20160302164548.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
100301s2009 xxk| s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781848824973 |
| -- |
978-1-84882-497-3 |
| 024 7# - OTHER STANDARD IDENTIFIER |
|---|
| Standard number or code |
10.1007/978-1-84882-497-3 |
| Source of number or code |
doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
UY |
| Source |
bicssc |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
UYA |
| Source |
bicssc |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
COM014000 |
| Source |
bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
COM031000 |
| Source |
bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.0151 |
| Edition number |
23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Singh, Arindama. |
| Relator term |
author. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Elements of Computation Theory |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc. |
by Arindama Singh. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
London : |
| Name of producer, publisher, distributor, manufacturer |
Springer London, |
| Date of production, publication, distribution, manufacture, or copyright notice |
2009. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XIII, 422 p. |
| Other physical details |
online resource. |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Content type code |
txt |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
computer |
| Media type code |
c |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
online resource |
| Carrier type code |
cr |
| Source |
rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS |
|---|
| File type |
text file |
| Encoding format |
PDF |
| Source |
rda |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Texts in Computer Science, |
| International Standard Serial Number |
1868-0941 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Mathematical Preliminaries -- Regular Languages -- Equivalences -- Structure of Regular Languages -- Context-free Languages -- Structure of CFLs -- Computably Enumerable Languages -- A Noncomputably Enumerable Language -- Algorithmic Solvability -- Computational Complexity. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
As Computer Science progressively matures as an established discipline, it becomes increasingly important to revisit its theoretical foundations, learn the appropriate techniques for answering theory-based questions, and build one’s confidence in implementing this knowledge when building computer applications. Students well-grounded in theory and abstract models of computation can excel in computing’s many application arenas. Through a deft interplay of rigor and intuitive motivation, Elements of Computation Theory comprehensively, yet flexibly provides students with the grounding they need in computation theory. The book is self-contained and introduces the fundamental concepts, models, techniques, and results that form the basic paradigms of computing. Readers will benefit from the discussion of the ideas and mathematics that computer scientists use to model, to debate, and to predict the behavior of algorithms and computation. Previous learning about set theory and proof by induction are helpful prerequisites. Topics and features:Contains an extensive use of definitions, proofs, exercises, problems, and other pedagogical aidsSupplies a summary, bibliographical remarks, and additional (progressively challenging) problems in each chapter, as well as an appendix containing hints and answers to selected problemsReviews mathematical preliminaries such as set theory, relations, graphs, trees, functions, cardinality, Cantor’s diagonalization, induction, and the pigeon-hole principleExplores regular languages, covering the mechanisms for representing languages, the closure properties of such languages, the existence of other languages, and other structural propertiesInvestigates the class of context-free languages, including context-free grammars, Pushdown automata, their equivalence, closure properties, and existence of non-context-free languagesDiscusses the true nature of general algorithms, introducing unrestricted grammars, Turing machines, and their equivalenceExamines which tasks can be achieved by algorithms and which tasks can’t, covering issues of decision problems in regular languages, context-free languages, and computably enumerable languagesProvides a concise account of both space and time complexity, explaining the main techniques of log space reduction, polynomial time reduction, and simulationsPromotes students' confidence via interactive learning and motivational, yet informal dialogueEmphasizes intuitive aspects and their realization with rigorous formalization Undergraduate students of computer science, engineering, and mathematics will find this core textbook ideally suited for courses on the theory of computation, automata theory, formal languages, and computational models. Computing professionals and other scientists will also benefit from the work’s accessibility, plethora of learning aids, and motivated exposition. Dr. Arindama Singh is a professor at the Department of Mathematics of the Indian Institute of Technology Madras and has authored books on logic for computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer mathematics. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computational Science and Engineering. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Relationship information |
Printed edition: |
| International Standard Book Number |
9781848824966 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| Uniform title |
Texts in Computer Science, |
| International Standard Serial Number |
1868-0941 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="http://dx.doi.org/10.1007/978-1-84882-497-3">http://dx.doi.org/10.1007/978-1-84882-497-3</a> |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
