Author:
Aubrun Nathalie,Béal Marie–Pierre
Subject
Computer Science Applications,General Mathematics,Software
Reference22 articles.
1. N. Aubrun and M.-P. Béal, Decidability of conjugacy of tree-shifts of finite type. InICALP ’09: Proc. of the 36th International Colloquium on Automata, Languages and Programming. Springer-Verlag Berlin, Heidelberg (2009) 132–143.
2. N. Aubrun and M.-P. Béal, Sofic and almost of finite type tree-shifts. In5th International Computer Science Symposium in Russia, (CSR’10), edited by E. Mayr and F. Ablayev, number 6072 inLect. Notes Comput. Sci.Springer-Verlag (2010) 12–24.
3. Aubrun N. and Béal M.-P., Tree-shifts of finite type.Theoret. Comput. Sci.459(2012) 16–25.
4. Aubrun N. and Béal M.-P., Sofic tree-shifts.Theory Comput. Syst.53(2013) 621–644.
5. Béal M.-P., Fiorenzi F. and Perrin D., A hierarchy of shift equivalent sofic shifts.Theoret. Comput. Sci.345(2005) 190–205.
Cited by
4 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. Tree shift topological entropy;Theoretical Computer Science;2018-09
4. Uniform Sampling of Subshifts of Finite Type on Grids and Trees;International Journal of Foundations of Computer Science;2017-04