Sofic-Dyck shifts
Formal Languages and Automata Theory
2015-09-18 v7 Discrete Mathematics
Abstract
We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Inoue, Krieger and Matsumoto. Sofic-Dyck shifts are shifts of sequences whose finite factors form unambiguous context-free languages. We show that they correspond exactly to the class of shifts of sequences whose sets of factors are visibly pushdown languages. We give an expression of the zeta function of a sofic-Dyck shift.
Cite
@article{arxiv.1305.7413,
title = {Sofic-Dyck shifts},
author = {Marie-Pierre Béal and Michel Blockelet and Cǎtǎlin Dima},
journal= {arXiv preprint arXiv:1305.7413},
year = {2015}
}