Shifts of k-nested sequences

详细信息    查看全文

• 作者：Marie-Pierre Bé ; al ; ^{beal@u-pem.fr} ; Pavel Heller ^{pavel.heller@u-pem.fr}
• 关键词：Dyck shifts ; Markov&ndash ; Dyck shifts ; Sofic-Dyck shifts ; Sofic shifts ; Symbolic dynamics ; Visibly-pushdown languages ; Zeta function
• 刊名：Theoretical Computer Science
• 出版年：2017
• 出版时间：7 January 2017
• 年：2017
• 卷：658
• 期：part_PA
• 页码：18-26
• 全文大小：355 K
• 卷排序：658

文摘

We introduce a new class of subshifts of sequences, called k-graph shifts, which expresses nested constraints on k symbols instead of on two symbols like for Dyck shifts. These shifts share many properties with Markov–Dyck shifts but are generally not conjugate to them. We prove that they are conjugate to sofic-Dyck shifts. We give a computation of the multivariate zeta function for this class of shifts.