10% off all books and free delivery over £50
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.


Part of the Encyclopedia of Mathematics and Its Applications series

View All Editions (829)

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Synopsis

Substitutions play a role in many problems, such as combinatorics on words, linear recurrent sequences, numeration systems, and complexity theory. This text offers a unified treatment of these problems and easy access to the results and methods of proof. It presents a comprehensive survey of sequences and shift spaces defined by substitutions.

The book covers important results, such as the finiteness theorem for minimal morphic shifts, which characterizes a minimal morphic shift by the finiteness of its set of derivatives. Other highlights include the proof of the recognizability property under very general assumptions and the classification of complexity types for substitution shifts. The work culminates with the proof of the decidability of conjugacy for minimal morphic shifts.

This is an essential resource for graduate students and academic researchers in dynamical systems.

About This Edition

ISBN: 9781009779302
Publication date:
Author:
Publisher: Cambridge University Press
Format: Hardback
Pagination: 690 pages
Series: Encyclopedia of Mathematics and Its Applications
Genres: Discrete mathematics
Algebra

Frequently asked questions