On the Markov-Dyck shifts of vertex type
From MaRDI portal
Publication:2515686
Exact enumeration problems, generating functions (05A15) Symbolic dynamics (37B10) Functional analytic techniques in dynamical systems; zeta functions, (Ruelle-Frobenius) transfer operators, etc. (37C30) Dynamical systems involving maps of trees and graphs (37E25) General theory of (C^*)-algebras (46L05)
Abstract: For a given finite directed graph , there are two types of Markov-Dyck shifts, the Markov-Dyck shift of vertex type and the Markov-Dyck shift of edge type. It is shown that, if does not have multi-edges, the former is a finite-to-one factor of the latter, and they have the same topological entropy. An expression for the zeta function of a Markov-Dyck shift of vertex type is given. It is different from that of the Markov-Dyck shift of edge type.
Recommendations
Cites work
- C^-algebras arising from Dyck systems of topological Markov chains
- A categorical invariant of flow equivalence of shifts
- A class of C*-algebras and topological Markov chains
- An Introduction to Symbolic Dynamics and Coding
- Circular codes, loop counting, and zeta-functions
- Cuntz-Krieger algebras and a generalization of Catalan numbers
- Dyck path enumeration
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- NOTE ON THE RECURRENCE OF A MARKOV CHAIN
- On a syntactically defined invariant of symbolic dynamics
- ON SUBSHIFTS AND SEMIGROUPS
- On the uniqueness of the equilibrium state
- Simple \(C^*\)-algebras generated by isometries
- Subsystems of finite type and semigroup invariants of subshifts
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Zeta functions and topological entropy of the Markov-Dyck shifts
Cited in
(4)
This page was built for publication: On the Markov-Dyck shifts of vertex type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515686)