Theses and Dissertations

Date of Award

7-2022

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

Dr. Robert Schweller

Second Advisor

Dr. Tim Wylie

Third Advisor

Dr. Bin Fu

Abstract

Constructing patterns is a well-studied problem in both theoretical and experimental self-assembly with much of the work focused on multi-staged assembly. In this paper, we study building 1D patterns in a model of active self assembly: Tile Automata. This is a generalization of the 2-handed assembly model that borrows the concept of state changes from Cellular Automata. In this work we further develop the model by partitioning states as colors and show lower and upper bounds for building patterned assemblies based on an input pattern. Our first two sections utilize recent results to build binary strings along with Turing machine constructions to get Kolmogorov optimal state complexity for building patterns in Tile Automata, and show nearly optimal bounds for one case. For affinity strengthening Tile Automata, where transitions can only increase affinity so there is no detachment, we focus on scaled patterns based on Space Bounded Kolmogorov Complexity. Finally, we examine the affinity strengthening freezing case providing an upper bound based on the minimum context-free grammar. This system utilizes only one dimensional assemblies and has tiles that do not change color.

Comments

Copyright 2022 Sonya Cirlos. All Rights Reserved.

https://go.openathens.net/redirector/utrgv.edu?url=https://www.proquest.com/dissertations-theses/encoding-color-sequences-active-tile-self/docview/2742633180/se-2?accountid=7119

Download

Share

COinS