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

£103.28

Society for Industrial and Applied Mathematics (SIAM) Algebraic Theory of Automata Networks: A Introduction: An Introduction (Monographs on Discrete Mathematics and Applications)

Name: Algebraic Theory of Automata Networks: A Introduction: An Introduction (Monographs on Discrete Mathematics and Applications)
Brand: Society for Industrial and Applied Mathematics (SIAM)
Price: 103.28 GBP
Availability: InStock

Network Topics

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

View at Amazon

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

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

£103 today · previous high £103 · all-time low £103

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 53 days · 53 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 53 days • 1 price levels

Days at Price

Price Analysis

Most common price: £103 (53 days, 100.0%)

Price range: £103 - £103

Price levels: 1 different prices over 53 days

Description

Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories. Automata networks are investigated as products of automata, and the fundamental results in regard to automata networks are surveyed and extended, including the main decomposition theorems of Letichevsky, and of Krohn and Rhodes. The text summarizes the most important results of the past four decades regarding automata networks and presents many new results discovered since the last book on this subject was published. Several new methods and special techniques are discussed, including characterization of homomorphically complete classes of automata under the cascade product; products of automata with semi-Letichevsky criterion and without any Letichevsky criteria; automata with control words; primitive products and temporal products; network completeness for digraphs having all loop edges; complete finite automata network graphs with minimal number of edges; and emulation of automata networks by corresponding asynchronous ones.

Product Specifications

Brand: Society for Industrial and Applied Mathematics (SIAM)
Format: hardcover
ASIN: 0898715695
Category: Books > Subjects > Computing & Internet > Networking & Security > Network Topics
Domain: Amazon UK
Release Date: 01 December 2004
Listed Since: 10 December 2006

Barcode

No barcode data available

Society for Industrial and Applied Mathematics (SIAM) Algebraic Theory of Automata Networks: A Introduction: An Introduction (Monographs on Discrete Mathematics and Applications)

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Networks of Learning Automata: Techniques for Online Stochastic Optimization

Topics in Intersection Graph Theory (Monographs on Discrete Mathematics and Applications): 2 (Monographs on Discrete Mathematics and Applications, Series Number 2)

Recent Advances in Learning Automata: 754 (Studies in Computational Intelligence, 754)

Power Algebras over Semirings: With Applications in Mathematics and Computer Science: 488 (Mathematics and Its Applications, 488)

Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Petri Net Algebra (Monographs in Theoretical Computer Science. An EATCS Series)

Weighted Automata, Formal Power Series and Weighted Logic (BestMasters)

An Introduction to Formal Languages and Machine Computation

Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

The q-theory of Finite Semigroups (Springer Monographs in Mathematics)

Graph Classes: A Survey (Monographs on Discrete Mathematics and Applications): 3 (Monographs on Discrete Mathematics and Applications, Series Number 3)

Petri Net Algebra (Monographs in Theoretical Computer Science. An EATCS Series)

Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach (Princeton Series in Computer Science)

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

Modeling and Control of Logical Discrete Event Systems: 300 (The Springer International Series in Engineering and Computer Science, 300)

Automatic Sequences: Theory, Applications, Generalizations

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

Innovative Algorithms and Techniques in Automation, Industrial Electronics and Telecommunications

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

Boolean Algebras in Analysis: 540 (Mathematics and Its Applications, 540)

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

Regulated Grammars and Automata

Computational Invariant Theory: 130 (Encyclopaedia of Mathematical Sciences, 130)

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