Computation and Automata: 25 (Encyclopedia of Mathematics and its Applications, Series Number 25) - Image 1

£64.79

Cambridge University Press Computation and Automata: 25 (Encyclopedia of Mathematics and its Applications, Series Number 25)

Name: Computation and Automata: 25 (Encyclopedia of Mathematics and its Applications, Series Number 25)
Brand: Cambridge University Press
Price: 64.79 GBP
Availability: InStock

Discrete Mathematics

Price History & Forecast

Last 32 days • 32 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 32 days • 1 price levels

Days at Price

Price Analysis

Most common price: £65 (32 days, 100.0%)

Price range: £65 - £65

Price levels: 1 different prices over 32 days

Description

In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.

Product Specifications

Brand: Cambridge University Press
Format: paperback
ASIN: 0521177332
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Discrete Mathematics
Domain: Amazon UK
Release Date: 28 April 2011
Listed Since: 09 June 2010

Barcode

No barcode data available

Cambridge University Press Computation and Automata: 25 (Encyclopedia of Mathematics and its Applications, Series Number 25)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Jewels are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa

Computability: An Introduction to Recursive Function Theory

Springer Recent Advances in Formal Languages and Applications 25

Automata Theory with Modern Applications

Automata Theory with Modern Applications

Automata and Computability

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

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers: Volume 125 (Studies in Logic and the Foundations of Mathematics, Volume 125)

Computational Complexity: A Conceptual Perspective

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

Automata Theory

Mathematical Foundations of Computer Science

Automata and Computability (Undergraduate Texts in Computer Science)

Introduction to Coalgebra: Towards Mathematics of States and Observation: 59 (Cambridge Tracts in Theoretical Computer Science, Series Number 59)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Automata and Languages (Oxford Science Publications)

Computability

Computational Complexity: A Modern Approach

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Universal Algebra for Computer Scientists: 25 (Monographs in Theoretical Computer Science. An EATCS Series, 25)

Computable Structure Theory: Within the Arithmetic (Perspectives in Logic)

Theory of Computation

Formal Languages and Computation: Models and Their Applications

Springer Semirings, Automata, Languages: 5 Monographs