加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本