Price loading...

Springer Automata and Computability

Name: Automata and Computability
Brand: Springer

1 black & white illustrations

AI & Machine Learning

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

Product Specifications

Brand: Springer
Model: 1 black & white illustrations
Format: hardcover
ASIN: 0387949070
Category: Books > Subjects > Computing & Internet > Computer Science > AI & Machine Learning
Domain: Amazon UK
Release Date: 30 April 1997
Listed Since: 16 February 2007

Barcode

No barcode data available

Springer Automata and Computability

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Automata and Computability (Undergraduate Texts in Computer Science)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Theory of Computation

Introduction to the Theory of Computation

Theory of Computation (Texts in Computer Science)

Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)

Computability

Automata and Languages (Oxford Science Publications)

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

The Foundations of Computability Theory

What Can Be Computed? – A Practical Guide to the Theory of Computation

Mathematical Foundations of Computer Science

Automata Theory

Computability: An Introduction to Recursive Function Theory

Formal Languages and Computation: Models and Their Applications

Computability Theory: An Introduction to Recursion Theory

Finite Automata

Computation Engineering: Applied Automata Theory and Logic

Automata Theory and Formal Languages (De Gruyter Textbook)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

A Programming Approach to Computability (Monographs in Computer Science)

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

An Introduction to Formal Languages and Automata