Search
 
Home| Join Our Mailing List| New Reviews| New Titles
Editor's Choice| Bestsellers| Textbooks| Book Series| Study Guides| E-Catalogues
  COMPUTER SCIENCE
  Artificial Intelligence
Database/ Information
Sciences

Decision Sciences
Digital Security
Fuzzy Logic
Machine Vision/ Pattern
Recognition

Neural Networks/ Networking
Parallel Processing/
Supercomputing

Software Engineering
Theoretical Computer Science
General
New Titles
December Bestsellers
Editor's Choice
Nobel Lectures
Textbooks
Recent Reviews
Book Series
Related Journals
  • International Journal of Semantic Computing (IJSC)
  • International Journal of Information Acquisition (IJIA)
  • Journal of Information & Knowledge Management (JIKM)
  • Computer Science Journals
  • New Mathematics and Natural Computation (NMNC)
  • Request for related catalogues
     
      PRODUCTS
      Journals
    eBooks
    Journals Archives
    eProceedings
     
      RESOURCES
      Print flyer
  • Full Version
  • Condensed Version
  • Recommend title
    Request for Inspection copy
    For Librarians
    For Authors
    For Booksellers
    For Translation Rights About Us
    Contact Us
    How to Order News
     
    Bookmark and Share

    FORMAL MODELS OF COMPUTATION
    The Ultimate Limits of Computing

    by Arthur Fleck (University of Iowa, USA)

    Table of Contents (79k)
    Preface (196k)
    Chapter 0: Mathematical Preliminaries (1,034k)

    This book provides new presentations of standard computational models that help avoid pitfalls of the conventional description methods. It also includes novel approaches to some of the topics that students normally find the most challenging. The presentations have evolved in response to student feedback over many years of teaching and have been well received by students.

    The book covers the topics suggested in the ACM curriculum guidelines for the course on “Theory of Computation”, and in the course on “Foundations of Computing” in the model liberal arts curriculum. These are standard courses for upper level computer science majors and beginning graduate students.

    The material in this area of computing is intellectually deep, and students invariably find it challenging to master. This book blends the three key ingredients for successful mastery. The first is its focus on the mingling of intuition and rigor that is required to fully understand the area. This is accomplished not only in the discussion and in examples, but also especially in the proofs. Second, a number of practical applications are presented to illustrate the capacity of the theoretical techniques to contribute insights in a variety of areas; such presentations greatly increase the reader's motivation to grasp the theoretical material. The student's active participation is the third and final major element in the learning process, and to this end an extensive collection of problems of widely differing difficulty is incorporated.

     
    Contents:
    • The Finite State Paradigm:
      • Regular Expressions and Acceptors
      • Properties of Regular Languages
      • Transducers and Other Variations
    • Context-Free Grammars and Automata:
      • Basic Grammar Definitions
      • Pushdown Store Automata
      • Properties of Context-Free Languages
    • General Computability Models:
      • Context-Sensitive Languages
      • Turing Machines and Computability
      • The Universal Machine and Impossible Computations.
     
    Readership: Undergraduate and graduate students in computer science.
     
    “In this book, the author presents a comprehensive survey, suitable as a text for advanced undergraduates or beginning graduate students, of computation models that span the traditional range: finite state automata, pushdown automata, linear bounded automata, and Turing machines.”
    Mathematical Reviews, 2002
     
    548pp    Pub. date: Mar 2001  
    ISBN:   978-981-02-4500-9
    981-02-4500-9
       US$112 / £74

     


     

    Imperial College Press  |  Global Publishing  |  Asia-Pacific Biotech News  |  Innovation Magazine
    Labcreations Co  |  Meeting Matters  |  National Academies Press

    Copyright © 2012 World Scientific Publishing Co. All rights reserved.
    Updated on 13 February 2012