AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a homomorphism from one shift of finite type to another. Also we consider an equivalence relation on subshifts, called weak equivalence, which was introduced and studied by Beal and Perrin. We classify arbitrary shifts of finite type up to weak equivalence
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequenc...
AbstractLet (Σ, σ) be a Zd-subshift of finite type. Under a strong irreducibility condition (strong ...
This thesis studies two independent topics in symbolic dynamics, the positive rational strong shift ...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
A G-shift of finite type (G-SFT) is a shift of finite type which commutes with the continuous action...
We introduce the following notion of weak equivalence between shifts of finite type. Two shifts of f...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equi...
ABSTRACT. An aim of this article is to highlight dynamical differences between the greedy, and hence...
We use the theory of Borel equivalence relations to analyze the equiva-lence relation of isomorphism...
Abstract. We investigate algebraic properties of the automorphism group of mul-tidimensional shifts ...
We give a necessary and sufficient condition in order that a type-shifting automorphism be construct...
This note extends and strengthens a theorem of Bates that says that row-finite graphs that are stron...
A one-dimensional shift of finite type with entropy at least log factors onto the full -shift. The f...
We study the relations of shift equivalence and strong shift equivalence for matrices over a ring $\...
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequenc...
AbstractLet (Σ, σ) be a Zd-subshift of finite type. Under a strong irreducibility condition (strong ...
This thesis studies two independent topics in symbolic dynamics, the positive rational strong shift ...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
A G-shift of finite type (G-SFT) is a shift of finite type which commutes with the continuous action...
We introduce the following notion of weak equivalence between shifts of finite type. Two shifts of f...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equi...
ABSTRACT. An aim of this article is to highlight dynamical differences between the greedy, and hence...
We use the theory of Borel equivalence relations to analyze the equiva-lence relation of isomorphism...
Abstract. We investigate algebraic properties of the automorphism group of mul-tidimensional shifts ...
We give a necessary and sufficient condition in order that a type-shifting automorphism be construct...
This note extends and strengthens a theorem of Bates that says that row-finite graphs that are stron...
A one-dimensional shift of finite type with entropy at least log factors onto the full -shift. The f...
We study the relations of shift equivalence and strong shift equivalence for matrices over a ring $\...
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequenc...
AbstractLet (Σ, σ) be a Zd-subshift of finite type. Under a strong irreducibility condition (strong ...
This thesis studies two independent topics in symbolic dynamics, the positive rational strong shift ...
DOI
Add to ORKG