My Account Log in

2 options

Automatic sequences / by Friedrich von Haeseler.

DGBA Mathematics - 2000 - 2014 Available online

View online

Ebook Central Academic Complete Available online

View online
Format:
Book
Author/Creator:
Haeseler, Friedrich von.
Series:
Gruyter expositions in mathematics ; 36.
De Gruyter expositions in mathematics ; 36
Language:
English
Subjects (All):
Sequences (Mathematics).
Algorithms.
Physical Description:
1 online resource (199 p.)
Edition:
Reprint 2013
Place of Publication:
Berlin ; New York : Walter de Gruyter, c2003.
Language Note:
English
Summary:
Automatic sequences are sequences which are produced by a finite automaton. Although they are not random they may look as being random. They are complicated, in the sense of not being not ultimately periodic, they may look rather complicated, in the sense that it may not be easy to name the rule by which the sequence is generated, however there exists a rule which generates the sequence. The concept automatic sequences has special applications in algebra, number theory, finite automata and formal languages, combinatorics on words. The text deals with different aspects of automatic sequences...
Contents:
Front matter
Contents
Chapter 1. Preliminaries
Chapter 2. Expanding endomorphisms and substitutions
Chapter 3. Automaticity
Chapter 4. Automaticity II
Chapter 5. Algebraic properties
Back matter
Notes:
Description based upon print version of record.
Includes bibliographical references (p. [177]-188) and index.
ISBN:
9786611993450
9781281993458
128199345X
9783110197969
3110197960
OCLC:
232160051

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account