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...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Allouche, Jean-Paul 1953- (VerfasserIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cambridge Cambridge University Press 2003
Schlagworte:	Sequential machine theory Sequences (Mathematics) Automatische Folge Formale Sprache Zahlentheorie
Online-Zugang:	BSB01 FHN01 Volltext
Zusammenfassung:	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
Beschreibung:	Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Beschreibung:	1 online resource (xvi, 571 pages)
ISBN:	9780511546563
DOI:	10.1017/CBO9780511546563