We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
A necessary and sufficient condition is given for the existence of an embedding of an irreducible subshift of finite type into the Fibonacci–Dyck shift.
Berstel, J. and Perrin, D.. The origins of combinatorics on words. European J. Combin.28 (2007), 996–1022.Google Scholar
[BPR]
Berstel, J., Perrin, D. and Reutenauer, Ch.. Codes and Automata. Cambridge University Press, Cambridge, 2010.Google Scholar
[HI]
Hamachi, T. and Inoue, K.. Embeddings of shifts of finite type into the Dyck shift. Monatsh. Math.145 (2005), 107–129.Google Scholar
[HIK]
Hamachi, T., Inoue, K. and Krieger, W.. Subsystems of finite type and semigroup invariants of subshifts. J. Reine Angew. Math.632 (2009), 37–61.Google Scholar
[HK]
Hamachi, T. and Krieger, W.. A construction of subshifts and a class of semigroups. Preprint, 2013, arXiv:1303.4158 [math.DS].Google Scholar
[Ki]
Kitchens, B. P.. Symbolic Dynamics. Springer, New York, 1998.Google Scholar
[KM]
Krieger, W. and Matsumoto, K.. Zeta functions and topological entropy of the Markov–Dyck shifts. Münster J. Math.4 (2011), 171–184.Google Scholar
[Kr1]
Krieger, W.. On the uniqueness of the equilibrium state. Math. Syst. Theory8 (1974), 97–104.Google Scholar
[Kr2]
Krieger, W.. On a syntactically defined invariant of symbolic dynamics. Ergod. Th. & Dynam. Sys.20 (2000), 501–516.Google Scholar
[LM]
Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.Google Scholar
[M]
Matsumoto, K.. C∗ -algebras arising from Dyck systems of topological Markov chains. Math. Scand.109 (2011), 31–54.CrossRefGoogle Scholar
[NP]
Nivat, M. and Perrot, J.-F.. Une généralisation du monoîde bicyclique. C. R. Math. Acad. Sci. Paris271 (1970), 824–827.Google Scholar
[P]
Perrin, D.. Algebraic combinatorics on words. Algebraic Combinatorics and Computer Science. Eds. Crapo, H. and Senato, D.. Springer, Berlin, Heidelberg, New York, 2001, pp. 391–430.Google Scholar