product iamge

Automatic Sequences

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Presents a general approach to studying sequences generated by a finite device. Haeseler (Katholieke Universiteit Leuven, Belgium) first introduces the concepts of substitution on the space of sequences, expanding group endomorphisms, and the kernel graph of a sequence. The main part of the book develops an algorithm for constructing a minimal automaton for a given automatic sequence, investigates the properties of H-automatic sequences and sequences generated by substitutions, and considers the solution of Mahler equations

Author(s): Friedrich Von Haeseler
Series: De Gruyter expositions in mathematics 36
Publisher: Walter de Gruyter
Year: 2003

Language: English
Pages: 201
City: Berlin; New York