The Resource Elements of computation theory, Arindama Singh
Elements of computation theory, Arindama Singh
Resource Information
The item Elements of computation theory, Arindama Singh represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Elements of computation theory, Arindama Singh represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 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 theorybased questions, and build one's confidence in implementing this knowledge when building computer applications. Students wellgrounded 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 selfcontained 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 pigeonhole 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 contextfree languages, including contextfree grammars, Pushdown automata, their equivalence, closure properties, and existence of noncontextfree 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, contextfree 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
 Language
 eng
 Extent
 1 online resource.
 Contents

 Mathematical Preliminaries
 Regular Languages
 Equivalences
 Structure of Regular Languages
 Contextfree Languages
 Structure of CFLs
 Computably Enumerable Languages
 A Noncomputably Enumerable Language
 Algorithmic Solvability
 Computational Complexity
 Isbn
 9781848824966
 Label
 Elements of computation theory
 Title
 Elements of computation theory
 Statement of responsibility
 Arindama Singh
 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 theorybased questions, and build one's confidence in implementing this knowledge when building computer applications. Students wellgrounded 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 selfcontained 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 pigeonhole 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 contextfree languages, including contextfree grammars, Pushdown automata, their equivalence, closure properties, and existence of noncontextfree 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, contextfree 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
 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
 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  Contextfree 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/9781848824973
 http://library.link/vocab/ext/overdrive/overdriveId
 9781848824966
 Specific material designation
 remote
 System control number
 (OCoLC)405546193
 Label
 Elements of computation theory, Arindama Singh
 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  Contextfree 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/9781848824973
 http://library.link/vocab/ext/overdrive/overdriveId
 9781848824966
 Specific material designation
 remote
 System control number
 (OCoLC)405546193
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/ElementsofcomputationtheoryArindama/bNK02aQzO6c/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ElementsofcomputationtheoryArindama/bNK02aQzO6c/">Elements of computation theory, Arindama Singh</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Elements of computation theory, Arindama Singh
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/ElementsofcomputationtheoryArindama/bNK02aQzO6c/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ElementsofcomputationtheoryArindama/bNK02aQzO6c/">Elements of computation theory, Arindama Singh</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>