大葉大學圖書館 |

登入

回首頁

Automatic Sequences :[electronic res...

Allouche, Jean-Paul.

Automatic Sequences :[electronic resource].Theory, Applications, Generalizations.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	515/.24
書名/作者:	Automatic Sequences : : Theory, Applications, Generalizations.
作者:	Allouche, Jean-Paul.
其他作者:	Shallit, Jeffrey.
出版者:	Cambridge : : Cambridge University Press,, 2003.
面頁冊數:	589 p.
ISBN:	9780511546563 (electronic bk.)
ISBN:	9780521823326 (print)
內容註:	Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 1 Stringology; 2 Number Theory and Algebra; 3 Numeration Systems; 4 Finite Automata and Other Models of Computation; 5 Automatic Sequences; 6 Uniform Morphisms and Automatic Sequences; 7 Morphic Sequences; 8 Frequency of Letters; 9 Characteristic Words; 10 Subwords; 11 Cobham’s Theorem; 12 Formal Power Series; 13 Automatic Real Numbers; 14 Multidimensional Automatic Sequences; 15 Automaticity; 16 kappa-Regular Sequences; 17 Physics; Appendix Hints, References, and Solutions for Selected Exercises; Bibliography; Index
摘要、提要註:	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 physics. Suitable for graduates or advanced undergraduates.
電子資源:	Click here to view book

Automatic Sequences :[electronic resource].Theory, Applications, Generalizations.
Allouche, Jean-Paul.

Automatic Sequences :Theory, Applications, Generalizations.[electronic resource]. - Cambridge :Cambridge University Press,2003. - 589 p.

Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 1 Stringology; 2 Number Theory and Algebra; 3 Numeration Systems; 4 Finite Automata and Other Models of Computation; 5 Automatic Sequences; 6 Uniform Morphisms and Automatic Sequences; 7 Morphic Sequences; 8 Frequency of Letters; 9 Characteristic Words; 10 Subwords; 11 Cobham’s Theorem; 12 Formal Power Series; 13 Automatic Real Numbers; 14 Multidimensional Automatic Sequences; 15 Automaticity; 16 kappa-Regular Sequences; 17 Physics; Appendix Hints, References, and Solutions for Selected Exercises; Bibliography; Index

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 physics. Suitable for graduates or advanced undergraduates.

Electronic reproduction.

Available via World Wide Web.

Mode of access: World Wide Web.

ISBN: 9780511546563 (electronic bk.)Index Terms--Genre/Form:

336502
Electronic books.

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

Dewey Class. No.: 515/.24

Automatic Sequences :[electronic resource].Theory, Applications, Generalizations.
LDR:01797nam a22002773u 4500 001 405799
003 AU-PeEL
005 20090601202844.0
006 m d
007 cr mn---------
008 140714t2003 ||| s |||||||eng|d
020 $a 9780511546563 (electronic bk.)
020 $a 9780521823326 (print)
035 $a EBL217594
035 $a EBL217594
040 $a AU-PeEL $c AU-PeEL $d AU-PeEL
050 0 0 $a QA267.5. S4 $b A55 2003
082 0 0 $a 515/.24
100 1 $a Allouche, Jean-Paul. $3 567448
245 1 0 $a Automatic Sequences : $b Theory, Applications, Generalizations. $h [electronic resource].
260 $a Cambridge : $b Cambridge University Press, $c 2003.
300 $a 589 p.
505 0 $a Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 1 Stringology; 2 Number Theory and Algebra; 3 Numeration Systems; 4 Finite Automata and Other Models of Computation; 5 Automatic Sequences; 6 Uniform Morphisms and Automatic Sequences; 7 Morphic Sequences; 8 Frequency of Letters; 9 Characteristic Words; 10 Subwords; 11 Cobham’s Theorem; 12 Formal Power Series; 13 Automatic Real Numbers; 14 Multidimensional Automatic Sequences; 15 Automaticity; 16 kappa-Regular Sequences; 17 Physics; Appendix Hints, References, and Solutions for Selected Exercises; Bibliography; Index
520 $a 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 physics. Suitable for graduates or advanced undergraduates.
533 $a Electronic reproduction. $n Available via World Wide Web.
538 $a Mode of access: World Wide Web.
655 7 $a Electronic books. $2 local $3 336502
700 1 $a Shallit, Jeffrey. $3 567449
710 2 $a Ebooks Corporation. $3 380544
776 1 $z 9780521823326
856 4 0 $z Click here to view book $u http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511546563

筆 0 讀者評論

多媒體

多媒體檔案
http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511546563

評論

新增評論分享你的心得

Export

取書館別