Decidability of Conjugacy of Tree-Shifts of Finite Type-Reference-Cited by-同舟云学术

Decidability of Conjugacy of Tree-Shifts of Finite Type

Published:2009 Issue: Volume: Page:132-143
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Aubrun Nathalie,Béal Marie-Pierre

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02927-1_13

Reference15 articles.

1. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata (release October 12, 2007)

2. Coven, E., Johnson, A., Jonoska, N., Madden, K.: The symbolic dynamics of multidimensional tiling systems. Ergodic Theory and Dynamical Systems 23(02), 447–460 (2003)

3. Hedlund, G.: Endomorphisms and automorphisms of the shift dynamical system. Theory of Computing Systems 3(4), 320–375 (1969)

4. Johnson, A., Madden, K.: The decomposition theorem for two-dimensional shifts of finite type. In: Proceedings-American Mathematical Society, vol. 127, pp. 1533–1544 (1999)

5. Kitchens, B.P.: Symbolic dynamics. Universitext, One-sided, two-sided and countable state Markov shifts. Springer, Berlin (1998)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the stability and shadowing of tree-shifts of finite type;Proceedings of the American Mathematical Society;2024-06-18

2. Entropy on regular trees;Discrete & Continuous Dynamical Systems - A;2020

3. A language hierarchy and Kitchens-type theorem for self-similar groups;Journal of Algebra;2019-11

4. Undecidable Word Problem in Subshift Automorphism Groups;Computer Science – Theory and Applications;2019

5. Tree shift topological entropy;Theoretical Computer Science;2018-09