9780521823326 - Automatic Sequences: Theory, Applications, Generalizations di Allouche, Jean-Paul; Shallit, Jeffrey (23 risultati)

Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Hard Cover. Condizione: As New. No Jacket. (2003), 571pp, rmndr mark to bottom pg edges, no dj, contents clean. Remainder.

Condizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Karton Karton. Condizione: Sehr gut. 571 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 1160.

Condizione: New. pp. xvi + 571.

Condizione: New. pp. xvi + 571 Illus.

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!

Condizione: New. pp. xvi + 571 170 Line Diagrams.

Condizione: Sehr gut. XVI, 571 Seiten, Zust: Gutes Exemplar. Mit Vorbesitzereintrag. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 1160 gebundene Ausgabe gebundene Ausgabe.

Condizione: New. In.

Condizione: New. This book is the first integrated treatment of sequences generated by finite automata and their generalizations. Num Pages: 588 pages, 170 b/w illus. 548 exercises. BIC Classification: PBH; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 184 x 261 x 38. Weight in Grams: 1170. . 2003. Hardcover. . . . .

Hardback. Condizione: New. 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.

Condizione: New. This book is the first integrated treatment of sequences generated by finite automata and their generalizations. Num Pages: 588 pages, 170 b/w illus. 548 exercises. BIC Classification: PBH; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 184 x 261 x 38. Weight in Grams: 1170. . 2003. Hardcover. . . . . Books ship from the US and Ireland.

Hardcover. Condizione: Brand New. 571 pages. 10.25x7.50x1.50 inches. In Stock.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Hardback. Condizione: New. 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.

Hardcover. Condizione: Brand New. 571 pages. 10.25x7.50x1.50 inches. In Stock. This item is printed on demand.

Hardcover. Condizione: new. Hardcover. 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. This book is an integrated treatment of sequences generated by finite automata and their generalizations. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Condizione: new. Hardcover. 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. This book is an integrated treatment of sequences generated by finite automata and their generalizations. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This is a book about the sequences of symbols that can be generated by simple models of computation called finite automata . It starts from first principles and develops the basic theory, then demonstrates applications to problems in number theory and phys.