This thesis studies two independent topics in symbolic dynamics, the positive rational strong shift equivalence and the mapping class group of a shift of finite type. In the first chapter, we give several results involving strong shift equivalence of positive matrices over the rational or real numbers, within the path component framework of Kim and Roush. Given a real matrix B with spectral radius less than 1, we consider the number of connected components of the space T+(B) of positive invariant tetrahedra of B. We show that T+(B) has finitely many components. For many cases of B, we show that T+(B) is path connected. We also give examples of B for which T+(B) has 2 components. If S is a subring of R containing Q we show that every primit...
AbstractIf Z is the group of integers, A a finite alphabet and AZ the set of all functions c:Z→A, th...
Abstract. We investigate algebraic properties of the automorphism group of mul-tidimensional shifts ...
AbstractIf A is a finite alphabet and Γ is a finitely generated amenable group, Ceccherini-Silberste...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
We study the relations of shift equivalence and strong shift equivalence for matrices over a ring $\...
We give an introduction to the "stable algebra of matrices" as related to certain problems in symbol...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
AbstractFor two square matrices A, B of possibly different sizes with nonnegative integer entries, w...
An expository account of recent progress on twistwise flow equivalence. There is a new result in the...
AbstractWe show that two positive matrices over Q+ or R+ which lie in the same component of a set {M...
AbstractWe define new subclasses of the class of irreducible sofic shifts. These classes form an inf...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
Let G be a finite group. We classify G-equivariant flow equivalence of non-trivial irreducible shift...
This book describes the relation between profinite semigroups and symbolic dynamics. Profinite semig...
AbstractIf Z is the group of integers, A a finite alphabet and AZ the set of all functions c:Z→A, th...
Abstract. We investigate algebraic properties of the automorphism group of mul-tidimensional shifts ...
AbstractIf A is a finite alphabet and Γ is a finitely generated amenable group, Ceccherini-Silberste...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
We study the relations of shift equivalence and strong shift equivalence for matrices over a ring $\...
We give an introduction to the "stable algebra of matrices" as related to certain problems in symbol...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
AbstractFor two square matrices A, B of possibly different sizes with nonnegative integer entries, w...
An expository account of recent progress on twistwise flow equivalence. There is a new result in the...
AbstractWe show that two positive matrices over Q+ or R+ which lie in the same component of a set {M...
AbstractWe define new subclasses of the class of irreducible sofic shifts. These classes form an inf...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
Let G be a finite group. We classify G-equivariant flow equivalence of non-trivial irreducible shift...
This book describes the relation between profinite semigroups and symbolic dynamics. Profinite semig...
AbstractIf Z is the group of integers, A a finite alphabet and AZ the set of all functions c:Z→A, th...
Abstract. We investigate algebraic properties of the automorphism group of mul-tidimensional shifts ...
AbstractIf A is a finite alphabet and Γ is a finitely generated amenable group, Ceccherini-Silberste...