Related papers: Subshifts, $\lambda$-graph bisystems and $C^*$-alg…
This paper is a continuation of the paper entitled "Subshifts, $\lambda$-graph bisystems and $C^*$-algebras", arXiv:1904.06464. A $\lambda$-graph bisystem consists of a pair of two labeled Bratteli diagrams satisfying certain compatibility…
A $\lambda$-graph system $\frak L$ is a labeled Bratteli diagram with shift operation. It is a generalized notion of finite labeled graph and presents a subshifts. We will study continuous orbit equivalence of one-sided subshifts and…
A $\lambda$-graph system ${\frak L}$ is a generalization of a finite labeled graph and presents a subshift. We will prove that the topological dynamical systems $(X_{{\frak L}_1},\sigma_{{\frak L}_1})$ and $(X_{{\frak L}_2},\sigma_{{\frak…
$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…
A $\lambda$-graph bisystem $\mathcal{L}$ consists of two labeled Bratteli diagrams $(\mathcal{L}^-,\mathcal{L}^+)$, that presents a two-sided subshift $\Lambda_\mathcal{L}$. We will construct a compact totally disconnected metric space with…
A $\lambda$-graph system is a labeled Bratteli diagram with some additional structure, which presents a subshift and yields a $C^*$-algebra. In this paper, we construct a $\lambda$-graph system from a pushdown automaton, such that the…
A $\lambda$-graph system is a labeled Bratteli diagram with certain additional structure, which presents a subshift. The class of the $C^*$-algebras $\mathcal{O}_{\frak L}$ associated with the $\lambda$-graph systems is a generalized class…
A certain synchronizing property for subshifts called $\lambda$-synchronization yields $\lambda$-graph systems called the $\lambda$-synchronizing $\lambda$-graph systems for the subshifts. The $\lambda$-synchronizing $\lambda$-graph system…
We will introduce a notion of normal subshifts. A subshift $(\Lambda,\sigma)$ is said to be normal if it satisfies a certain synchronizing property called $\lambda$-synchronizing and is infinite as a set. We have lots of purely infinite…
The notions of symbolic matrix system and $\lambda$-graph system for a subshift are generalizations of symbolic matrix and $\lambda$-graph (= finite symbolic matrix) for a sofic shift respectively ([Doc. Math. 4(1999), 285-340]). M. Nasu…
Let $A$ be an $N \times N $ irreducible matrix with entries in $\{0,1\}$. We define the topological Markov Dyck shift $D_A$ to be a nonsofic subshift consisting of the $2N$ brackets $(_1,...,(_N,)_1,...,)_N$ with both standard bracket rule…
A $C^*$-symbolic dynamical system $({\cal A}, \rho, \Sigma)$ is a finite family $\{\rho_\alpha\}_{\alpha \in\Sigma}$ of endomorphisms of a $C^*$-algebra ${\cal A}$ with some conditions. It yields a $C^*$-algebra ${\cal O}_\rho$ from an…
We discuss a synchronization property for subshifts, that we call $\lambda$-synchronization. Under an irreducibility assumption we associate to a $\lambda$-synchronizing subshift a simple and purely infinite $C^*$-algebra.
In this paper, we introduce a C*-algebra associated to any substitution (via its Bratteli diagram model). We show that this C*-algebra contains the partial crossed product C*-algebra of the corresponding Bratteli-Vershik system and show…
We describe a class of $C^*$-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space $C^*$-algebras of Matsumoto. In doing so we shed some new light on the different $C^*$-algebras that may be…
We introduce a class of subshifts under the name of "standard one-counter shifts". The standard one-counter shifts are the Markov coded systems of certain Markov codes that belong to the family of one-counter languages. We study topological…
We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…
Kengo Matsumoto has introduced lambda-graph systems and strong shift equivalence of lambda-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a lambda-graph system. The strong shift equivalence class of the…
We give a combinatorial description of a family of 2-graphs which subsumes those described by Pask, Raeburn and Weaver. Each 2-graph $\Lambda$ we consider has an associated $C^*$-algebra, denoted $C^*(\Lambda)$, which is simple and purely…
It is now well known that a simple graph $C^*$-algebra $C^*(E)$ of a directed graph $E$ is either AF or purely infinite. In this paper, we address the question of whether this is the case for labeled graph $C^*$-algebras recently introduced…