Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-10T12:47:57.076Z Has data issue: false hasContentIssue false

Embedding Bratteli–Vershik systems in cellular automata

Published online by Cambridge University Press:  15 October 2009

MARCUS PIVATO
Affiliation:
Department of Mathematics, Trent University, 1600 West Bank Drive, Peterborough, Ontario, K9J 7B8, Canada (email: marcuspivato@trentu.ca, ryassawi@trentu.ca)
REEM YASSAWI
Affiliation:
Department of Mathematics, Trent University, 1600 West Bank Drive, Peterborough, Ontario, K9J 7B8, Canada (email: marcuspivato@trentu.ca, ryassawi@trentu.ca)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Many dynamical systems can be naturally represented as Bratteli–Vershik (or adic) systems, which provide an appealing combinatorial description of their dynamics. If an adic system X is linearly recurrent, then we show how to represent X using a two-dimensional subshift of finite type Y; each ‘row’ in a Y-admissible configuration corresponds to an infinite path in the Bratteli diagram of X, and the vertical shift on Y corresponds to the ‘successor’ map of X. Any Y-admissible configuration can then be recoded as the space-time diagram of a one-dimensional cellular automaton Φ; in this way X is embedded in Φ (i.e. X is conjugate to a subsystem of Φ). With this technique, we can embed many odometers, Toeplitz systems, and constant-length substitution systems in one-dimensional cellular automata.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2009