Automatic Sequences: Theory, Applications, Generalizations - Image 1

£63.20

Cambridge University Press Automatic Sequences: Theory, Applications, Generalizations

Name: Automatic Sequences: Theory, Applications, Generalizations
Brand: Cambridge University Press
Price: 63.2 GBP
Availability: InStock

170 b/w illus. 548 exercises

Architecture & Microprocessors

This is the most expensive it has ever been. Walk away.

£63 today · previous high £63 · all-time low £58

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

Historical

Generating forecast...

Price Distribution

Price distribution over 83 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £63 (40 days, 48.2%)

Price range: £58 - £63

Price levels: 5 different prices over 83 days

Description

Uniting dozens of seemingly disparate results from different fields, this book combines concepts from mathematics and computer science to present the first integrated treatment of sequences generated by 'finite automata'. The authors apply the theory to the study of automatic sequences and their generalizations, such as Sturmian words and k-regular sequences. And further, they provide applications to number theory (particularly to formal power series and transcendence in finite characteristic), physics, computer graphics, and music. Starting from first principles wherever feasible, basic results from combinatorics on words, numeration systems, and models of computation are discussed. Thus this book is suitable for graduate students or advanced undergraduates, as well as for mature researchers wishing to know more about this fascinating subject. Results are presented from first principles wherever feasible, and the book is supplemented by a collection of 460 exercises, 85 open problems, and over 1600 citations to the literature.

Key Features

Used Book in Good Condition

Product Specifications

Brand: Cambridge University Press
Model: 170 b/w illus. 548 exercises
Format: hardcover
ASIN: 0521823323
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 21 July 2003
Listed Since: 22 January 2007

Barcode

No barcode data available

Cambridge University Press Automatic Sequences: Theory, Applications, Generalizations

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

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

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

Introduction to Finite Fields and their Applications

Combinatorial Mathematics

125 Problems in Text Algorithms: with Solutions

Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An EATCS Series)

A Course on Set Theory

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

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

Algorithms on Strings

Probability, Random Processes, and Statistical Analysis: Applications to Communications, Signal Processing, Queueing Theory and Mathematical Finance

Elements of Continuum Mechanics and Thermodynamics

Algorithmic Graph Theory

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

Restarting Automata: Extensions and Generalizations (Theory and Applications of Computability)

Applications of Continuous Mathematics to Computer Science: 38 (Theory and Decision Library B, 38)

General Irreducible Markov Chains: 83 (Cambridge Tracts in Mathematics, Series Number 83)

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

Zeta Functions of Graphs: A Stroll through the Garden: 128 (Cambridge Studies in Advanced Mathematics, Series Number 128)

Restarting Automata: Extensions and Generalizations (Theory and Applications of Computability)

Cellular Automata: A Parallel Model: 460 (Mathematics and Its Applications, 460)

Cellular Automata: A Parallel Model: 460 (Mathematics and Its Applications, 460)

Matroid Applications: 40 (Encyclopedia of Mathematics and its Applications, Series Number 40)

All the Mathematics You Missed: But Need to Know for Graduate School