相关论文: On the Markov-Dyck shifts of vertex type
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a Markov-Dyck shift is given. The derivation of this expression is based on a formula in Keller (G. Keller, {\it Circular codes, loop counting,…
A class of highly symmetric Markov-Dyck shifts is introduced. Topological entropies and zeta functions are determined.
We study the neutral periodic points of the Markov-Dyck shifts of finite strongly connected directed graphs. Under certain hypothesis on the structure of the graphs we show, that the topological conjugacy of their Markov-Dyck shifts implies…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Inoue, Krieger and Matsumoto. Sofic-Dyck shifts are shifts of sequences whose finite factors form unambiguous context-free languages. We…
We introduce notions of suspension and flow equivalence on one-sided topological Markov shifts, which we call one-sided suspension and one-sided flow equivalence, respectively. We prove that one-sided flow equivalence is equivalent to…
$S$-gap shifts are a well-studied class of shift spaces, which has led to several proposed generalizations. This paper introduces a new class of shift spaces called $\mathcal{S}$-graph shifts whose essential structure is encoded in a novel…
In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…
We discuss a method of calculating the zeta function of subshifts which have a presentation by a finite directed graph labeled by elements of the associated inverse semigroup. This class of subshifts is introduced as a class of property A…
We show that the one-sided Dyck shift has a unique tail invariant topologically $\sigma$-finite measure (up to scaling). This invariant measure of the one sided Dyck turns out to be a shift-invariant probability. Furthermore, it is one of…
A $D_{\infty}$-topological Markov chain can be represented by a pair of zero-one square matrices, which is called a flip pair. We introduce the concepts of $D_{\infty}$-strong shift equivalence and $D_{\infty}$-shift equivalence, which are…
We study Markov multi-maps of the interval from the point of view of topological dynamics. Specifically, we investigate whether they have various properties, including topological transitivity, topological mixing, dense periodic points, and…
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck…
We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…
We study discrete flow equivalence of two-sided topological Markov shifts by using extended Ruelle algebras. We characterize flow equivalence of two-sided topological Markov shifts in terms of conjugacy of certain actions weighted by…
In a previous paper by the author, it was shown that the One sided Dyck is uniquely ergodic with respect to the one sided-tail relation, where the tail invariant probability is also shift invariant and obtains the topological entropy. In…
To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.