Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Noncooperative algorithms in self-assembly   We show the first non-trivial positive algorithmic results (i.e. programs
whose output is larger than their size), in a model of self-assembly that has
so far resisted many attempts of formal analysis or programming: the planar
non-cooperative variant of Winfree's abstract Tile Assembly Model.
  This model has been the center of several open problems and conjectures in
the last fifteen years, and the first fully general results on its
computational power were only proven recently (SODA 2014). These results, as
well as ours, exemplify the intricate connections between computation and
geometry that can occur in self-assembly.
  In this model, tiles can stick to an existing assembly as soon as one of
their sides matches the existing assembly. This feature contrasts with the
general cooperative model, where it can be required that tiles match on
\emph{several} of their sides in order to bind.
  In order to describe our algorithms, we also introduce a generalization of
regular expressions called Baggins expressions. Finally, we compare this model
to other automata-theoretic models.

6
The categories of this paper are: astro-ph
36
The categories of this paper are: cmp-lg
20
The categories of this paper are: acc-phys
3
The categories of this paper are: physics
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc