000 02245nam a22003378i 4500
001 CR9780511546563
003 UkCbUP
005 20200124160258.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 090508s2003||||enk o ||1 0|eng|d
020 _a9780511546563 (ebook)
020 _z9780521823326 (hardback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA267.5.S4
_bA55 2003
082 0 0 _a515/.24
_221
100 1 _aAllouche, Jean-Paul,
_d1953-
_eauthor.
245 1 0 _aAutomatic sequences :
_btheory, applications, generalizations /
_cJean-Paul Allouche, Jeffrey Shallit.
264 1 _aCambridge :
_bCambridge University Press,
_c2003.
300 _a1 online resource (xvi, 571 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520 _aUniting 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.
650 0 _aSequential machine theory.
650 0 _aSequences (Mathematics)
700 1 _aShallit, Jeffrey Outlaw,
_eauthor.
776 0 8 _iPrint version:
_z9780521823326
856 4 0 _uhttps://doi.org/10.1017/CBO9780511546563
999 _c520126
_d520124