89 search results - page 5 / 18 » Complex tilings |
FSTTCS
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
EJC
2007
13 years 8 months ago
2007
: We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct f...
UPP
2004
Springer
14 years 1 months ago
2004
Springer
Self-assembly is the spontaneous self-ordering of substructures into superstructures driven by the selective affinity of the substructures. DNA provides a molecular scale material...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...