activity
20112026
most citedSliding block codes between shift spaces over infinite alphabets

19 citations · 99 across the 14 of their papers we have counts for

collaborators
Showing math.DSShow all

5 papers · 1 filter

math.DS2016★ 2 cited

Bratteli-Vershik models for partial actions of

Thierry Giordano, Daniel Gonçalves, Charles Starling

Let and be open subsets of the Cantor set with finite disjoint complements, and let be a homeomorphism with dense orbits. Building from the ideas of Herman, Putn…

math.DS2015★ 3 cited

Inverse semigroup shifts over countable alphabets

Daniel Gonçalves, Marcelo Sobottka, Charles Starling

In this work we characterize shift spaces over infinite countable alphabets that can be endowed with an inverse semigroup operation. We give sufficient conditions under which zero-…

math.DS2015★ 17 cited

Two-sided shift spaces over infinite alphabets

Daniel Gonçalves, Marcelo Sobottka, Charles Starling

Ott, Tomforde, and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea we develop a notion of two-sided shift spaces ov…

math.DS2015★ 19 cited

Sliding block codes between shift spaces over infinite alphabets

Daniel Gonçalves, Marcelo Sobottka, Charles Starling

Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In th…

math.DS2013

Division Point Measures from Primitive Substitutions

Daniel Gonçalves, Charles Starling

In this note we extend results of Olli concerning limits of point measures arising from substitutions. We consider a general primitive substitution on a finite polygon set in $\mat…