A Construction of Subshifts and a Class of Semigroups

Abstract

Subshifts with property $(A)$ are constructed from a class of directed graphs. As special cases the Markov-Dyck shifts are shown to have property $(A)$. The semigroups, that are associated to $\mathcal{R}$-graph shifts with Property (A), are determined. Also results on the reconstruction of $\mathcal{R}$-graphs from their $\mathcal{R}$-graph shifts are obtained.

23 pages

References in corpus (3)

• On subshift presentations
• On Certain Subshifts and their Associated Monoids
• Finite-type-Dyck shift spaces

Cited by in corpus (5)

• A categorical invariant of flow equivalence of shifts
• On subshift presentations
• Some notes on the classification of shift spaces: Shifts of Finite Type; Sofic Shifts; and Finitely Defined Shifts
• Pushdown automata, lambda-graph systems and C*-algebras
• On the Markov-Dyck shifts of vertex type