Abstract
We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set . With additionally given a relation between the edges in and the edges in , and denoting the vertex set of the graph by , we speak of an an -graph . From -graphs we construct semigroups (with zero) that we call -graph semigroups. We describe a method of presenting subshifts by means of suitably structured labelled directed graphs with vertex set , edge set , and a label map that asigns to the edges in labels in an -graph semigroup . We call the presented subshift an -presentation. We introduce a Property and a Property (c), tof subshifts, and we introduce a notion of strong instantaneity. Under an assumption on the structure of the -graphs we show for strongly instantaneous subshifts with Property and associated semigroup , that Properties and (c) are necessary and sufficient for the existence of an -presentation, to which the subshift is topologically conjugate,
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.