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

£93.47

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

Name: Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words (Networks and Telecommunications)
Brand: Wiley
Price: 93.47 GBP
Availability: InStock

Architecture & Microprocessors

About as cheap as it gets. The only time it was cheaper was 3 months ago.

£93 today · all-time low £93 (Jun 2026) · usually £94

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

Historical

Generating forecast…

Price Distribution

Price distribution over 70 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £95 (34 days, 48.6%)

Price range: £93 - £96

Price levels: 4 different prices over 70 days

Description

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory.

Product Specifications

Brand: Wiley
Format: hardcover
ASIN: 1848216157
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 04 November 2014
Listed Since: 15 March 2013

Barcode

No barcode data available

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

About as cheap as it gets. The only time it was cheaper was 3 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Words, Languages and Combinatorics III: Proceedings of the Third International Colloquium Kyoto, Japan 14-18 March 2000

Developments in Language Theory: 27th International Conference, DLT 2023, Umeå, Sweden, June 12–16, 2023, Proceedings: 13911 (Lecture Notes in Computer Science, 13911)

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

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

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

Automata Theory

Automata Theory with Modern Applications

Springer Semirings, Automata, Languages: 5 Monographs

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

Formal Languages and Compilation (Texts in Computer Science)

Automata Theory with Modern Applications

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Automata and Computability

An Introduction to Formal Languages and Automata

Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I: 9134 (Lecture Notes in Computer Science, 9134)

Finite Automata

Automata and Computability: A Programmer's Perspective

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

Springer Automata, Languages and Programming ICALP 2002

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

Formal Languages and Compilation (Texts in Computer Science)

Automata and Computability (Undergraduate Texts in Computer Science)

Academic Press Infinite Words - Automata, Semigroups, Logic

Sequences, Groups, and Number Theory (Trends in Mathematics)