Author:
Brijder Robert,Hoogeboom Hendrik Jan
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. L.M. Adleman, J. Kari, L. Kari, D. Reishus, On the decidability of self-Assembly of infinite ribbons, in: Proceedings 43rd Symposium on Foundations of Computer Science, FOCS 2002, 2002, pp. 530–537. doi:10.1109/SFCS.2002.1181977
2. Limit-(quasi-)periodic point sets as quasicrystals with p-adic internal spaces;Baake;Journal of Physics A: Mathematical and General,1998
3. M. Blum, C. Hewitt, Automata on a 2-dimensional tape, in: Proceedings 8th Symposium on Switching and Automata Theory, SWAT, 1967, pp. 155–160
4. Decision problems and regular chain code picture languages;Dassow;Discrete Applied Mathematics,1993
5. On the solvability of Domino snake problems;Etzion-Petruschka;Theoretic Computer Science,1994
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strategies to scan pictures with automata based on Wang tiles;RAIRO - Theoretical Informatics and Applications;2011-01
2. Picture Recognizability with Automata Based on Wang Tiles;SOFSEM 2010: Theory and Practice of Computer Science;2010