國立高雄大學圖資館 |

Language: English

Back

Automatic Sequences :Theory, Applica...

Allouche, Jean-Paul.

Automatic Sequences :Theory, Applications, Generalizations.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Automatic Sequences :
Reminder of title:	Theory, Applications, Generalizations.
Author:	Allouche, Jean-Paul.
other author:	Shallit, Jeffrey.
Published:	Cambridge :Cambridge University Press,2003.
Description:	589 p.
Online resource:	Click here to view book
ISBN:	9780511546563 (electronic bk.)

Automatic Sequences :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�� 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:

214472
Electronic books.

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

Dewey Class. No.: 515/.24

Automatic Sequences :Theory, Applications, Generalizations.
LDR:01789nmm a22002773u 4500 001 327269
003 AU-PeEL
005 20090601202844.0
006 m d
007 cr mn---------
008 120518t2003 ||| 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 324148
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�� 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 214472
700 1 $a Shallit, Jeffrey. $3 324147
710 2 $a Ebooks Corporation. $3 322111
776 1 $z 9780521823326
856 4 0 $z Click here to view book $u http://dx.doi.org/10.1017/CBO9780511546563