Abstract
We introduce a new class of subshifts of sequences, called generalized Dyck shifts, which extends the class of Dyck shifts introduced by Krieger. The finite factors of these shifts are factors of generalized Dyck words. Generalized Dyck words were introduced by Labelle and Yeh who exhibited unambiguous algebraic grammars generating these context-free languages. Other unambiguous algebraic grammars for generalized Dyck languages were found by Duchon. We define a coding of periodic patterns of generalized Dyck shifts which allows to compute their zeta function. We prove that the zeta function of a generalized Dyck shift is the commutative image of the generating function of an unambiguous context-free language and is thus an \({\mathbb {N}}\)-algebraic series.
This work is supported by the French National Agency (ANR) through “Programme d’Investissements d’Avenir” (Project ACRONYME no. ANR-10-LABX-58) and by the region of Île-de-France through the DIM RDM-IdF.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The definition of \(L_i\) differs here from the one given in [6].
References
Béal, M.-P., Blockelet, M., Dima, C.: Sofic-Dyck shifts. Theor. Comput. Sci. 609, 226–244 (2016)
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Encyclopedia of Mathematics and its Applications, vol. 129. Cambridge University Press, Cambridge (2010)
Berstel, J., Reutenauer, C.: Zeta functions of formal languages. Trans. Amer. Math. Soc. 321, 533–546 (1990)
Blanchard, F., Hansel, G.: Systèmes codés. Theor. Comput. Sci. 44, 17–49 (1986)
Bousquet-Mélou, M.: Rational and algebraic series in combinatorial enumeration. In: International Congress of Mathematicians, vol. III, pp. 789–826 (2006). Eur. Math. Soc., Zürich
Duchon, P.: On the enumeration and generation of generalized Dyck words. Discrete Math. 225(1–3), 121–135 (2000)
Jacquet, H., Mélançon, G.: Langages de Dyck généralisés et factorisations du monoide libre. Ann. Sci. Math. Québec 97, 103–122 (1997)
Keller, G.: Circular codes, loop counting, and zeta-functions. J. Combin. Theory Ser. A 56(1), 75–83 (1991)
Krieger, W.: On the uniqueness of the equilibrium state. Math. Systems Theory 8(2), 97–104 (1974/1975)
Krieger, W., Matsumoto, K.: Zeta functions and topological entropy of the Markov-Dyck shifts. Münster J. Math. 4, 171–183 (2011)
Labelle, J., Yeh, Y.: Generalized Dyck paths. Discrete Math. 82(1), 1–6 (1990)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Matsumoto, K.: On the simple \(C^*\)-algebras arising from Dyck systems. J. Operator Theory 58(1), 205–226 (2007)
Reutenauer, C.: \({\mathbb{N}}\)-rationality of zeta functions. Adv. Appl. Math. 18(1), 1–17 (1997)
Stanley, R.P.: Enumerative Combinatorics. Wadsworth Publ. Co., Belmont (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Béal, MP., Heller, P. (2017). Generalized Dyck Shifts. In: Weil, P. (eds) Computer Science – Theory and Applications. CSR 2017. Lecture Notes in Computer Science(), vol 10304. Springer, Cham. https://doi.org/10.1007/978-3-319-58747-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-58747-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58746-2
Online ISBN: 978-3-319-58747-9
eBook Packages: Computer ScienceComputer Science (R0)