Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T05:52:54.337Z Has data issue: false hasContentIssue false

A graph approach to computing nondeterminacy in substitutional dynamical systems

Published online by Cambridge University Press:  25 September 2007

Toke M. Carlsen
Affiliation:
University of Copenhagen, Universitetsparken 5, 2100 Copenhagen Ø, Denmark; toke@math.ku.dk School of Mathematical & Physical Sciences, Mathemathics Building - V123, University of Newcastle, University Drive, Callaghan NSW 2308, Australia.
Søren Eilers
Affiliation:
University of Copenhagen, Universitetsparken 5, 2100 Copenhagen Ø, Denmark; eilers@math.ku.dk
Get access

Abstract

We present an algorithm which for any aperiodic and primitivesubstitution outputs a finite representation ofeach special word in the shift space associated to that substitution, and determines when suchrepresentations are equivalent under orbit and shift tail equivalence. Thealgorithm has been implemented and applied in the study of certainnew invariants for flow equivalence of substitutional dynamical systems.

Information

Type
Research Article
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable