Knockout Narratives Sale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    The Powell's Playlist | January 5, 2015

    Tim Johnston: IMG The Powell's Playlist: Songs for Not Sleeping by Tim Johnston



    I once told a medical-profession-type lady that I didn't sleep well, that I awoke all through the night and was awake for hours. "What do you do... Continue »

    spacer

This item may be
out of stock.

Click on the button below to search for this title in other formats.


Check for Availability
Add to Wishlist

This title in other editions

Elements of Computation Theory (Texts in Computer Science)

Elements of Computation Theory (Texts in Computer Science) Cover

 

Synopses & Reviews

Publisher Comments:

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 aids • 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 • Reviews mathematical preliminaries such as set theory, relations, graphs, trees, functions, cardinality, Cantor's diagonalization, induction, and the pigeon-hole principle • Explores regular languages, covering the mechanisms for representing languages, the closure properties of such languages, the existence of other languages, and other structural properties • Investigates the class of context-free languages, including context-free grammars, Pushdown automata, their equivalence, closure properties, and existence of non-context-free languages • Discusses the true nature of general algorithms, introducing unrestricted grammars, Turing machines, and their equivalence • 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 • Provides a concise account of both space and time complexity, explaining the main techniques of log space reduction, polynomial time reduction, and simulations • Promotes students' confidence via interactive learning and motivational, yet informal dialogue • 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.

Synopsis:

This book introduces the fundamental concepts, models, techniques, and results that form the basic paradigms of computing. It examines all the essential topics in formal languages, automata, computability, and complexity.

Table of Contents

Mathematical Preliminaries.- Regular Languages.- Equivalences.- Structure of Regular Languages.- Context-free Languages.- Structure of CFLs.- Recursively Enumerable Languages.- A Non-recursively Enumerable Language.- Algorithmic Solvability.- Computational Complexity.

Product Details

ISBN:
9781848824966
Publisher:
Springer
Subject:
Computer Science
Author:
Singh, Arindama
Subject:
Applied
Subject:
Machine Theory
Subject:
Personal Computers-General
Subject:
Algorithms
Subject:
Automata
Subject:
Complexity
Subject:
computability
Subject:
Computation
Subject:
Formal languages
Subject:
Theory of computation
Subject:
Computational science and engineering
Edition Description:
2009
Series:
Texts in Computer Science
Publication Date:
20090531
Binding:
HARDCOVER
Language:
English
Illustrations:
Y
Pages:
436
Dimensions:
235 x 178 mm

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Science and Mathematics » Mathematics » Applied

Elements of Computation Theory (Texts in Computer Science)
0 stars - 0 reviews
$ In Stock
Product details 436 pages Springer - English 9781848824966 Reviews:
"Synopsis" by , This book introduces the fundamental concepts, models, techniques, and results that form the basic paradigms of computing. It examines all the essential topics in formal languages, automata, computability, and complexity.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.