Computer Science – Computational Complexity
Scientific paper
2010-02-19
Computer Science
Computational Complexity
Submitted to Theoretical Computer Science
Scientific paper
This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered adjacent to it. This includes classical neighborhoods of size four, as well as arbitrarily complex neighborhoods. A generalized tile system consists of a set of tiles, a neighborhood, and a relation which dictates which are the "admissible" neighboring tiles of a given tile. Thus, in correctly formed assemblies, tiles are assigned positions of the plane in accordance to this relation. We prove that any validly tiled path defined in a given but arbitrary neighborhood (a zipper) can be simulated by a simple "ribbon" of microtiles. A ribbon is a special kind of polyomino, consisting of a non-self-crossing sequence of tiles on the plane, in which successive tiles stick along their adjacent edge. Finally, we extend this construction to the case of traditional tilings, proving that we can simulate arbitrary-neighborhood tilings by simple-neighborhood tilings, while preserving some of their essential properties.
Kari Lila
Masson Benoit
No associations
LandOfFree
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-363941