Self-assembly of strings and languages

Erzsébet Csuhaj-Varjú, Ion Petre, György Vaszil

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Self-assembly is the process in which simple objects autonomously aggregate into large structures and it has become one of the major tools for nano-scale engineering. We propose in this paper a string-based framework inspired by the principle of self-assembly: two strings with a common overlap, say u v and v w, yield a string u v w; we say that string u v w has been assembled from strings u v and v w. The operation may be extended in a natural way also to sets of strings. We answer several questions: what is the assembly power of a given set of strings, can a given set of strings be generated through assembly and if so, what is a minimal generator for it?

Original languageEnglish
Pages (from-to)74-81
Number of pages8
JournalTheoretical Computer Science
Volume374
Issue number1-3
DOIs
Publication statusPublished - Apr 20 2007

Keywords

  • Base
  • Combinatorics
  • Generator
  • Self-assembly
  • Word

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Self-assembly of strings and languages'. Together they form a unique fingerprint.

  • Cite this