Self-assembly of strings and languages

E. 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

Fingerprint

Self-assembly
Self assembly
Strings
Language
Overlap
Generator
Engineering

Keywords

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Self-assembly of strings and languages. / Csuhaj-Varjú, E.; Petre, Ion; Vaszil, György.

In: Theoretical Computer Science, Vol. 374, No. 1-3, 20.04.2007, p. 74-81.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E. ; Petre, Ion ; Vaszil, György. / Self-assembly of strings and languages. In: Theoretical Computer Science. 2007 ; Vol. 374, No. 1-3. pp. 74-81.
@article{e55788a234a14888a1bb56a00f370bde,
title = "Self-assembly of strings and languages",
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?",
keywords = "Base, Combinatorics, Generator, Self-assembly, Word",
author = "E. Csuhaj-Varj{\'u} and Ion Petre and Gy{\"o}rgy Vaszil",
year = "2007",
month = "4",
day = "20",
doi = "10.1016/j.tcs.2006.12.004",
language = "English",
volume = "374",
pages = "74--81",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Self-assembly of strings and languages

AU - Csuhaj-Varjú, E.

AU - Petre, Ion

AU - Vaszil, György

PY - 2007/4/20

Y1 - 2007/4/20

N2 - 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?

AB - 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?

KW - Base

KW - Combinatorics

KW - Generator

KW - Self-assembly

KW - Word

UR - http://www.scopus.com/inward/record.url?scp=33947364341&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947364341&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2006.12.004

DO - 10.1016/j.tcs.2006.12.004

M3 - Article

AN - SCOPUS:33947364341

VL - 374

SP - 74

EP - 81

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -