On the Markov-Dyck shifts of vertex type

2014/05/26 by Kengo Matsumoto, Matsumoto, Kengo
Computer Science · Mathematics · #05A15 (Secondary) #37B10 (Primary) 46L05 #Cellular Automata and Applications #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #Operator Algebras (math.OA) #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.1405.6443

openalex publication_date 2014/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For a given finite directed graph G, there are two types of Markov-Dyck shifts, the Markov-Dyck shift D_G^V of vertex type and the Markov-Dyck shift D_G^E of edge type. It is shown that, if G 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.

Citations

• Combinatorial Enumeration

Related

• On a class of highly symmetric Markov-Dyck shifts
• Markov-Dyck shifts, neutral periodic points and topological conjugacy
• Families of directed graphs and topological conjugacy of the associated Markov-Dyck shifts
• Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties
• Double-Tail Invariant Measures of the Dyck Shift