Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952285 | Theoretical Computer Science | 2017 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Marie-Pierre Béal, Pavel Heller,