Abstract. In this paper we explore the relation betweenWang Tiles and Schonnkel Combinators in order to investigate Functional Combinators as an programming language for Self-assembly and DNA computing. We show: How any combinatorial program can be expressed in terms of Wang Tiles, and again, how any computation of the program ts into a grid of tiles of a suitable nite, tile set, and nally, how a program for Self-assembly DNA computing can be obtained. The result is a general methodology that, given any computable function, allows to dene a Self-assembly program that can be used to construct the computations of the function
DNA Tiles, Wang Tiles and Combinators
BELLIA, MARCO;OCCHIUTO, MARIA EUGENIA
2013-01-01
Abstract
Abstract. In this paper we explore the relation betweenWang Tiles and Schonnkel Combinators in order to investigate Functional Combinators as an programming language for Self-assembly and DNA computing. We show: How any combinatorial program can be expressed in terms of Wang Tiles, and again, how any computation of the program ts into a grid of tiles of a suitable nite, tile set, and nally, how a program for Self-assembly DNA computing can be obtained. The result is a general methodology that, given any computable function, allows to dene a Self-assembly program that can be used to construct the computations of the functionFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
