Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words

— —

Michel Rigo

Formal Languages, Automata and Numeration Systems 1

Introduction to Combinatorics on Words

Michel Rigo

$295.95

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

ISTE Ltd and John Wiley & Sons Inc
07 November 2014

Programming & scripting languages: general; Mathematical theory of computation

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.

By: Michel Rigo
Imprint: ISTE Ltd and John Wiley & Sons Inc
Country of Publication: United Kingdom
Dimensions: Height: 243mm, Width: 164mm, Spine: 25mm
Weight: 635g
ISBN: 9781848216150
ISBN 10: 1848216157
Pages: 338
Publication Date: 07 November 2014
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

Michel RIGO, Full professor, University of Liège, Department of Math., Belgium.

Reviews for Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words

This nice book is devoted to a quickly growing field, at the frontier between theoretical computer science, combinatorics, and number theory. (Zentralblatt MATH 2016) This nice book is devoted to a quickly growing eld, at the frontier between theoretical com- puter science, combinatorics, and number theory. The