Author:
Aubrun Nathalie,Béal Marie-Pierre
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference31 articles.
1. Aubrun, N., Béal, M.-P.: Decidability of conjugacy of tree-shifts of finite type. In: ICALP’09: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pp. 132–143. Springer, Berlin, Heidelberg (2009)
2. Lecture Notes in Computer Science;N. Aubrun,2010
3. Aubrun, N., Béal, M.-P.: Tree-shifts of finite type. Theor. Comput. Sci. 459, 16–25 (2012)
4. Bates, T., Eilers, S., Pask, D.: Reducibility of covers of AFT shifts. Isr. J. Math. 185, 207–234 (2011)
5. Béal, M.-P., Berstel, J., Eilers, S., Perrin, D.: Symbolic dynamics. Corros. Rev. (2010). arXiv:1006.1265 [cs.FL]
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献