Coverart for item
The Resource Elements of computation theory, Arindama Singh

Elements of computation theory, Arindama Singh

Label
Elements of computation theory
Title
Elements of computation theory
Statement of responsibility
Arindama Singh
Creator
Subject
Language
eng
Summary
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: {u2022} Contains an extensive use of definitions, proofs, exercises, problems, and other pedagogical aids {u2022} Supplies a summary, bibliographical remarks, and additional (progressively challenging) problems in each chapter, as well as an appendix containing hints and answers to selected problems {u2022} Reviews mathematical preliminaries such as set theory, relations, graphs, trees, functions, cardinality, Cantor's diagonalization, induction, and the pigeon-hole principle {u2022} Explores regular languages, covering the mechanisms for representing languages, the closure properties of such languages, the existence of other languages, and other structural properties {u2022} Investigates the class of context-free languages, including context-free grammars, Pushdown automata, their equivalence, closure properties, and existence of non-context-free languages {u2022} Discusses the true nature of general algorithms, introducing unrestricted grammars, Turing machines, and their equivalence {u2022} Examines 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 languages {u2022} Provides a concise account of both space and time complexity, explaining the main techniques of log space reduction, polynomial time reduction, and simulations {u2022} Promotes students' confidence via interactive learning and motivational, yet informal dialogue {u2022} Emphasizes 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
Member of
Cataloging source
GW5XE
http://library.link/vocab/creatorName
Singh, Arindama
Dewey number
511.3/52
Index
index present
Language note
English
LC call number
QA9.59
LC item number
.S56 2009
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
Series statement
Texts in computer science
http://library.link/vocab/subjectName
  • Computable functions
  • Computer science
  • Computer science
  • Computable functions
  • Informatique
  • Computable functions
  • Computer science
Label
Elements of computation theory, Arindama Singh
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
405546193
Dimensions
unknown
Extent
1 online resource.
Form of item
online
Isbn
9781848824966
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-1-84882-497-3
http://library.link/vocab/ext/overdrive/overdriveId
978-1-84882-496-6
Specific material designation
remote
System control number
(OCoLC)405546193
Label
Elements of computation theory, Arindama Singh
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
405546193
Dimensions
unknown
Extent
1 online resource.
Form of item
online
Isbn
9781848824966
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-1-84882-497-3
http://library.link/vocab/ext/overdrive/overdriveId
978-1-84882-496-6
Specific material designation
remote
System control number
(OCoLC)405546193

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...