£58.55

Cambridge University Press Finite-State Techniques: Automata, Transducers and Bimachines: 60 (Cambridge Tracts in Theoretical Computer Science, Series Number 60)

Price data last checked 136 day(s) ago - refreshing...

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

About as cheap as it gets. The only time it was cheaper was 1 year ago.

£59 today · all-time low £57 (Jan 2025) · usually the usual

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 390 days • 390 data points (No recent data available)

Historical
Generating forecast...
£61.59 £56.92 £57.94 £58.96 £59.98 £61.00 £62.02 01 January 2025 08 April 2025 14 July 2025 19 October 2025 25 January 2026

Price Distribution

Price distribution over 390 days • 5 price levels

Days at Price
Current Price
122 days 33 days · current 217 days 14 days 4 days 0 54 109 163 217 £58 £59 £60 £61 £62 Days at Price

Price Analysis

Most common price: £60 (217 days, 55.6%)

Price range: £58 - £62

Price levels: 5 different prices over 390 days

Description

Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice.

Product Specifications

Format
hardcover
Domain
Amazon UK
Release Date
01 August 2019
Listed Since
06 February 2019

Barcode

No barcode data available

Similar Products You Might Like

Automata Theory
98% match

Automata Theory

World Scientific Publishing Company

£67.00 22 Feb 2026
Automata and Languages (Oxford Science Publications)
97% match

Automata and Languages (Oxford Science Publications)

Oxford University Press

£49.98 13 Feb 2026
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)
97% match

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

Springer

£47.60 16 Feb 2026
Automata Theory with Modern Applications
97% match

Automata Theory with Modern Applications

Cambridge University Press

£72.79 10 Mar 2026
Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)
97% match

Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)

Springer

£139.99 13 Apr 2026
Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)
97% match

Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)

Springer

£163.34 11 Jan 2026
The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks (Symbolic Computation)
97% match

The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks (Symbolic Computation)

Springer

£76.13 24 Feb 2026
Formal Languages and Compilation (Texts in Computer Science)
97% match

Formal Languages and Compilation (Texts in Computer Science)

Springer

£45.61 20 Feb 2026
Automata Theory with Modern Applications
97% match

Automata Theory with Modern Applications

Cambridge University Press

£38.02 20 Feb 2026
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
97% match

Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)

Birkhauser

£82.74 26 Feb 2026
Automata Theory: An Algorithmic Approach
97% match

Automata Theory: An Algorithmic Approach

MIT Press

£51.10 13 Jan 2026
Finite Automata
96% match

Finite Automata

Chapman and Hall/CRC

£71.80 28 Feb 2026
Automata and Computability
96% match

Automata and Computability

Springer

£63.13 12 Jan 2026
Automata and Computability: A Programmer's Perspective
96% match

Automata and Computability: A Programmer's Perspective

CRC Press

£85.20 09 Apr 2026
Developments in Language Theory: 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings: 12811 (Lecture Notes in Computer Science, 12811)
96% match

Developments in Language Theory: 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings: 12811 (Lecture Notes in Computer Science, 12811)

Springer

£67.13 14 Feb 2026
Automata Implementation: First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers: 1260 (Lecture Notes in Computer Science, 1260)
96% match

Automata Implementation: First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers: 1260 (Lecture Notes in Computer Science, 1260)

Springer

£44.95 18 Apr 2026
Automata and Computability (Undergraduate Texts in Computer Science)
96% match

Automata and Computability (Undergraduate Texts in Computer Science)

Springer

£39.84 09 Feb 2026
Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions
96% match

Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions

Springer

£77.32 22 Feb 2026
The Unknown Component Problem: Theory and Applications
96% match

The Unknown Component Problem: Theory and Applications

Springer

£101.35 08 Jan 2026
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words (Networks and Telecommunications)
96% match

Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words (Networks and Telecommunications)

Wiley

£96.13 12 Jan 2026
An Introduction to Formal Languages and Automata
96% match

An Introduction to Formal Languages and Automata

Jones & Bartlett Learning

£61.06 08 Jan 2026
Formal Languages and Compilation (Texts in Computer Science)
96% match

Formal Languages and Compilation (Texts in Computer Science)

Springer

£62.28 11 Jan 2026
Automata, Logics, and Infinite Games: A Guide to Current Research: 2500 (Lecture Notes in Computer Science, 2500)
96% match

Automata, Logics, and Infinite Games: A Guide to Current Research: 2500 (Lecture Notes in Computer Science, 2500)

Springer

£59.99 12 Apr 2026
Regulated Grammars and Automata
96% match

Regulated Grammars and Automata

Springer

£109.99 21 Feb 2026