Abstract
One-sided sofic-Dyck shifts are sets of infinite sequences of symbols avoiding a visibly pushdown language of finite words. One-sided finite-type-Dyck shifts constitute a subclass of these sets of sequences. A (one-sided) finite-type-Dyck shift is defined as the set of infinite sequences avoiding both some finite set of words and some finite set of matching patterns. We prove that proper conjugacy is decidable for a large class of one-sided finite-type-Dyck shifts, the matched-return extensible shifts. This class contains many known non-sofic one-sided shifts like Dyck shifts and Motzkin shifts. It contains also strictly all extensible one-sided shifts of finite type. Our result is thus an extension of the decidability of conjugacy between one-sided shifts of finite type obtained by Williams.
M.-P. Béal and P. Heller—This work is supported by the French National Agency (ANR) through “Programme d’Investissements d’Avenir” (Project ACRONYME \(\text {n}^\circ \)ANR-10-LABX-58), through the ANR EQINOCS, 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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 202–211 (electronic). ACM, New York (2004)
Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009)
Aubrun, N., Béal, M.-P.: Tree-shifts of finite type. Theoret. Comput. Sci. 459, 16–25 (2012)
Béal, M.-P., Berstel, J., Eilers, S., Perrin, D.: Symbolic dynamics. to appear in Handbook of Automata (2010)
Béal, M.-P., Blockelet, M., Dima, C.: Finite-type-Dyck shift spaces. CoRR (2013). http://arxiv.org/1311.4223
Béal, M.-P., Blockelet, M., Dima, C.: Sofic-Dyck shifts. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 63–74. Springer, Heidelberg (2014)
Béal, M.-P., Blockelet, M., Dima, C.: Sofic-Dyck shifts. CoRR (2014). http://arxiv.org/1305.7413
Fujiwara, M.: Conjugacy for one-sided sofic systems. In: Dynamical Systems and Singular Phenomena (Kyoto, 1986), World Sci. Adv. Ser. Dynam. Systems, vol. 2, pp. 189–202. World Sci. Publishing, Singapore (1987)
Inoue, K., Krieger, W.: Subshifts from sofic shifts and Dyck shifts, zeta functions and topological entropy. CoRR (2010). abs/1001.1839
Kitchens, B.P.: Symbolic Dynamics, One-sided, two-sided and countable state Markov shifts. Universitext. Springer, Berlin (1998)
Krieger, W.: On the uniqueness of the equilibrium state. Math. Systems Theory 8(2), 97–104 (1974)
Krieger, W., Matsumoto, K.: Zeta functions and topological entropy of the Markov-Dyck shifts. Münster J. Math. 4, 171–183 (2011)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Williams, R.F.: Classification of subshifts of finite type. In: Beck, A. (ed.) Recent Advances in Topological Dynamics. LNCS, vol. 318, pp. 281–285. Springer, Heidelberg (1973)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Béal, MP., Heller, P. (2015). Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. In: Potapov, I. (eds) Developments in Language Theory. DLT 2015. Lecture Notes in Computer Science(), vol 9168. Springer, Cham. https://doi.org/10.1007/978-3-319-21500-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-21500-6_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21499-3
Online ISBN: 978-3-319-21500-6
eBook Packages: Computer ScienceComputer Science (R0)