| Publication | Date of Publication | Type |
|---|
On algorithmic self-assembly of squares by co-transcriptional folding
| 2024-09-11 | Paper |
Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami
Theoretical Computer Science | 2024-05-06 | Paper |
Oritatami systems assemble shapes No less complex than tile assembly model (ATAM)
| 2024-04-23 | Paper |
Freezing 1-Tag Systems with States
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Transcript design problem of oritatami systems
Natural Computing | 2024-02-09 | Paper |
Programmable single-stranded architectures for computing
Natural Computing | 2024-02-09 | Paper |
Nondeterministic seedless oritatami systems and hardness of testing their equivalence
Natural Computing | 2023-11-30 | Paper |
Counting infinitely by oritatami co-transcriptional folding
Natural Computing | 2023-09-08 | Paper |
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Simple intrinsic simulation of cellular automata in oritatami molecular folding model
| 2022-10-13 | Paper |
Proving the Turing universality of oritatami co-transcriptional folding
| 2022-07-21 | Paper |
Square network on a word
Theoretical Computer Science | 2021-11-11 | Paper |
A general architecture of oritatami systems for simulating arbitrary finite automata
Theoretical Computer Science | 2021-06-03 | Paper |
Counting infinitely by oritatami co-transcriptional folding
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
A general architecture of oritatami systems for simulating arbitrary finite automata
Lecture Notes in Computer Science | 2020-05-06 | Paper |
Self-attraction removal from oritatami systems
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
On the power of oritatami cotranscriptional folding with unary bead sequence
| 2019-10-15 | Paper |
Single-stranded architectures for computing
| 2019-10-15 | Paper |
3-color bounded patterned self-assembly
Natural Computing | 2019-07-08 | Paper |
Know when to fold 'em: self-assembly of shapes by folding in oritatami
| 2018-11-08 | Paper |
Transcript design problem of oritatami systems
| 2018-11-08 | Paper |
Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
| 2018-11-07 | Paper |
Programming biomolecules that fold greedily during transcription
| 2018-03-21 | Paper |
The complexity of fixed-height patterned tile self-assembly
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays
Fundamenta Informaticae | 2018-01-19 | Paper |
The power of nondeterminism in self-assembly
| 2017-09-29 | Paper |
Self-attraction removal from oritatami systems
| 2017-08-31 | Paper |
Rule set design problems for oritatami systems
Theoretical Computer Science | 2017-05-18 | Paper |
Binary pattern tile set synthesis is NP-hard
Algorithmica | 2017-05-11 | Paper |
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
The extended equation of Lyndon and Schützenberger
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Nondeterministic seedless oritatami systems and hardness of testing their equivalence
Lecture Notes in Computer Science | 2016-11-30 | Paper |
The complexity of fixed-height patterned tile self-assembly
Lecture Notes in Computer Science | 2016-11-09 | Paper |
scientific article; zbMATH DE number 6606353 (Why is no real title available?)
| 2016-07-26 | Paper |
Semilinear sets and counter machines: a brief survey
Fundamenta Informaticae | 2016-05-11 | Paper |
On computational complexity of graph inference from counting
Natural Computing | 2016-04-06 | Paper |
Dynamic simulation of 1D cellular automata in the Active aTAM
New Generation Computing | 2016-04-01 | Paper |
Square-density increasing mappings
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Binary pattern tile set synthesis is NP-hard
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Program size and temperature in self-assembly
Algorithmica | 2015-09-02 | Paper |
A stronger square conjecture on binary words
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Generalised Lyndon-Schützenberger Equations
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
scientific article; zbMATH DE number 6351478 (Why is no real title available?)
Theory of Computing | 2014-10-06 | Paper |
Operational State Complexity under Parikh Equivalence
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
3-color bounded patterned self-assembly (extended abstract)
Lecture Notes in Computer Science | 2014-07-07 | Paper |
On the behavior of tile assembly system at high temperatures
Computability | 2014-04-30 | Paper |
Transfer matrix analysis of one-dimensional majority cellular automata with thermal noise
Journal of Physics A: Mathematical and Theoretical | 2014-04-11 | Paper |
Computing minimum tile sets to self-assemble color patterns
Algorithms and Computation | 2014-01-14 | Paper |
On the open problem of Ginsburg concerning semilinear sets and related problems
Theoretical Computer Science | 2014-01-10 | Paper |
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
Information and Computation | 2013-12-19 | Paper |
Combinatorial Optimization in Pattern Assembly
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
On the boundedness property of semilinear sets
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Converting nondeterministic automata and context-free grammars into Parikh equivalent deterministic automata
Developments in Language Theory | 2012-11-02 | Paper |
One-reversal counter machines and multihead automata: revisited
Theoretical Computer Science | 2012-10-11 | Paper |
Schema for parallel insertion and deletion: revisited
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
On the behavior of tile assembly system at high temperatures
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Triangular and hexagonal tile self-assembly systems
Computation, Physics and Beyond | 2012-06-15 | Paper |
Iterated hairpin completions of non-crossing words
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Absoluteness of subword inequality is undecidable
Theoretical Computer Science | 2012-03-13 | Paper |
Program size and temperature in self-assembly
Algorithms and Computation | 2011-12-16 | Paper |
\(K\)-comma codes and their generalizations
Fundamenta Informaticae | 2011-11-22 | Paper |
On the regularity of iterated hairpin completion of a single word
Fundamenta Informaticae | 2011-11-22 | Paper |
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
Fundamenta Informaticae | 2011-06-14 | Paper |
An extension of the Lyndon-Schützenberger result to pseudoperiodic words
Information and Computation | 2011-04-28 | Paper |
PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
Orthogonal shuffle on trajectories
International Journal of Foundations of Computer Science | 2011-02-23 | Paper |
Block insertion and deletion on trajectories
Theoretical Computer Science | 2011-02-21 | Paper |
One-reversal counter machines and multihead automata: revisited
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Scalable, time-responsive, digital, energy-efficient molecular circuits using DNA strand displacement
Lecture Notes in Computer Science | 2011-01-28 | Paper |
Triangular tile self-assembly systems
Lecture Notes in Computer Science | 2011-01-28 | Paper |
Schema for parallel insertion and deletion
Developments in Language Theory | 2010-08-31 | Paper |
On a special class of primitive words
Theoretical Computer Science | 2010-02-05 | Paper |
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
Algebraic Informatics | 2009-11-05 | Paper |
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
Developments in Language Theory | 2009-07-07 | Paper |
Twin-roots of words and their properties
Theoretical Computer Science | 2009-06-04 | Paper |
On pseudoknot-bordered words and their properties
Journal of Computer and System Sciences | 2009-03-11 | Paper |
On a Special Class of Primitive Words
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Duplication in DNA Sequences
Developments in Language Theory | 2008-10-30 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
