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 show that the isomorphism relation for finitely generated solvable groups of class 3 is a weakly ...
Weak shift equivalence which arises in the dynamical study of certain attractors is shown to be an e...
One generally studies the different types of algebraic structures from the equivalence relation “bei...
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 use the theory of Borel equivalence relations to analyze the equiva-lence relation of isomorphism...
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequenc...
We define new subclasses of the class of sofic shifts. These classes form an infinite hierarchy. For...
AbstractWe define new subclasses of the class of irreducible sofic shifts. These classes form an inf...
Rufus Bowen left a notebook containing 157 open problems and questions. Problem 32 on that list asks...
A natural occcurrence of shift equivalence in a purely algebraic setting is exhibited
We study the notion of weak homomorphisms between coalgebras of different types generalizing thereby...
ABSTRACT. An aim of this article is to highlight dynamical differences between the greedy, and hence...
We show that the isomorphism relation for finitely generated solvable groups of class 3 is a weakly ...
Weak shift equivalence which arises in the dynamical study of certain attractors is shown to be an e...
One generally studies the different types of algebraic structures from the equivalence relation “bei...
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 use the theory of Borel equivalence relations to analyze the equiva-lence relation of isomorphism...
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequenc...
We define new subclasses of the class of sofic shifts. These classes form an infinite hierarchy. For...
AbstractWe define new subclasses of the class of irreducible sofic shifts. These classes form an inf...
Rufus Bowen left a notebook containing 157 open problems and questions. Problem 32 on that list asks...
A natural occcurrence of shift equivalence in a purely algebraic setting is exhibited
We study the notion of weak homomorphisms between coalgebras of different types generalizing thereby...
ABSTRACT. An aim of this article is to highlight dynamical differences between the greedy, and hence...
We show that the isomorphism relation for finitely generated solvable groups of class 3 is a weakly ...
Weak shift equivalence which arises in the dynamical study of certain attractors is shown to be an e...
One generally studies the different types of algebraic structures from the equivalence relation “bei...
DOI
Add to ORKG