大葉大學圖書館 |

登入

回首頁

Automatic sequences :theory, applica...

Allouche, Jean-Paul, (1953-)

Automatic sequences :theory, applications, generalizations /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	515/.24
書名/作者:	Automatic sequences : : theory, applications, generalizations // Jean-Paul Allouche, Jeffrey Shallit.
作者:	Allouche, Jean-Paul,
其他作者:	Shallit, Jeffrey Outlaw,
面頁冊數:	1 online resource (xvi, 571 pages) : : digital, PDF file(s).
附註:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
標題:	Sequential machine theory.
標題:	Sequences (Mathematics)
ISBN:	9780511546563 (ebook)
摘要、提要註:	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.
電子資源:	http://dx.doi.org/10.1017/CBO9780511546563

Automatic sequences :theory, applications, generalizations /
Allouche, Jean-Paul,1953-

Automatic sequences :theory, applications, generalizations /Jean-Paul Allouche, Jeffrey Shallit. - 1 online resource (xvi, 571 pages) :digital, PDF file(s).

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

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.

ISBN: 9780511546563 (ebook)Subjects--Topical Terms:

461309
Sequential machine theory.

LC Class. No.: QA267.5.S4 / A55 2003

Dewey Class. No.: 515/.24

Automatic sequences :theory, applications, generalizations /
LDR:02034nam a22002778i 4500 001 448939
003 UkCbUP
005 20160226154807.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 161201s2003||||enk o ||1 0|eng|d
020 $a 9780511546563 (ebook)
020 $z 9780521823326 (hardback)
035 $a CR9780511546563
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 0 0 $a QA267.5.S4 $b A55 2003
082 0 0 $a 515/.24 $2 21
100 1 $a Allouche, Jean-Paul, $d 1953- $e author. $3 644064
245 1 0 $a Automatic sequences : $b theory, applications, generalizations / $c Jean-Paul Allouche, Jeffrey Shallit.
264 1 $a Cambridge : $b Cambridge University Press, $c 2003.
300 $a 1 online resource (xvi, 571 pages) : $b digital, PDF file(s).
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 $a 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.
650 0 $a Sequential machine theory. $3 461309
650 0 $a Sequences (Mathematics) $3 465822
700 1 $a Shallit, Jeffrey Outlaw, $e author. $3 644065
776 0 8 $i Print version: $z 9780521823326
856 4 0 $u http://dx.doi.org/10.1017/CBO9780511546563

筆 0 讀者評論

多媒體

多媒體檔案
http://dx.doi.org/10.1017/CBO9780511546563

評論

新增評論分享你的心得

Export

取書館別