Abstract
We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Krieger and Matsumoto. The class of sofic-Dyck shifts is a particular class of shifts of sequences whose finite factors are unambiguous context-free languages. We show that it corresponds exactly to shifts of sequences whose set of factors is a visibly pushdown language. We give an expression of the zeta function of a sofic-Dyck shift which has a deterministic presentation. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Béal, M. P., Blockelet, M., & Dima, C. (2014). Sofic-dyck shifts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8634 LNCS, pp. 63–74). Springer Verlag. https://doi.org/10.1007/978-3-662-44522-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
