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

£133.94

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

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

Professionals & Academics

This is the usual price. Wait for it to drop, or tell us your number.

£134 today · usual range £111–£145 · best ever £111

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 69 days · 69 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 69 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £111 (24 days, 34.8%)

Price range: £111 - £145

Price levels: 4 different prices over 69 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.

Key Features

Used Book in Good Condition

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521302455
Category: Books > Subjects > Biography > Professionals & Academics
Domain: Amazon UK
Release Date: 23 May 1985
Listed Since: 08 January 2007

Barcode

No barcode data available

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

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Automatic Sequences: Theory, Applications, Generalizations

An Introduction to Formal Languages and Machine Computation

Theories of Computability

Combinatorics, Automata and Number Theory: 135 (Encyclopedia of Mathematics and its Applications, Series Number 135)

Arto Salomaa: Mathematician, Computer Scientist, and Teacher: A Thematic Biography

Noncommutative Rational Series with Applications: 137 (Encyclopedia of Mathematics and its Applications, Series Number 137)

LMS: 45 Recursion Theory, Applns: Its Generalisations & Applications, Proceedings of Logic Colloquim '79, Leeds, Aug. 1979 (London Mathematical Society Lecture Note Series, Series Number 45)

Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic): Series Number 48

Tree Automata and Languages (Volume 10) (Studies in Computer Science and Artificial Intelligence, Volume 10)

Thirty Five Years of Automating Mathematics: 28 (Applied Logic Series, 28)

Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)

Algebraic Theory of Automata Networks: A Introduction: An Introduction (Monographs on Discrete Mathematics and Applications)

Noisy Information and Computational Complexity

Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 ... (Lecture Notes in Computer Science, 1893)

Computational Semantics with Functional Programming

Lectures on the Logic of Computer Programming (CBMS-NSF Regional Conference Series in Applied Mathematics): 31 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 31)

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

Abstract Computing Machines: A Lambda Calculus Perspective (Texts in Theoretical Computer Science. An EATCS Series)

Combinatorial Mathematics

Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)

Advanced Topics in Bisimulation and Coinduction: 52 (Cambridge Tracts in Theoretical Computer Science, Series Number 52)

Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

Computation, Proof, Machine: Mathematics Enters a New Age

Introduction to Automata Theory, Languages, and Computation