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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.