Shinnosuke Seki

From MaRDI portal
Person:264985

Available identifiers

zbMath Open seki.shinnosukeMaRDI QIDQ264985

List of research outcomes

PublicationDate of PublicationType
Freezing 1-Tag Systems with States2024-04-09Paper
Transcript design problem of oritatami systems2024-02-09Paper
Nondeterministic seedless oritatami systems and hardness of testing their equivalence2023-11-30Paper
Counting infinitely by oritatami co-transcriptional folding2023-09-08Paper
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami2023-08-15Paper
Simple intrinsic simulation of cellular automata in oritatami molecular folding model2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50910132022-07-21Paper
Square network on a word2021-11-11Paper
A general architecture of oritatami systems for simulating arbitrary finite automata2021-06-03Paper
Counting Infinitely by Oritatami Co-transcriptional Folding2020-07-20Paper
A general architecture of oritatami systems for simulating arbitrary finite automata2020-05-06Paper
Self-Attraction Removal from Oritatami Systems2019-12-10Paper
On the power of oritatami cotranscriptional folding with unary bead sequence2019-10-15Paper
Single-stranded architectures for computing2019-10-15Paper
3-color bounded patterned self-assembly2019-07-08Paper
Know when to fold 'em: self-assembly of shapes by folding in oritatami2018-11-08Paper
Transcript design problem of oritatami systems2018-11-08Paper
Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding2018-11-07Paper
Programming Biomolecules That Fold Greedily During Transcription2018-03-21Paper
The Complexity of Fixed-Height Patterned Tile Self-assembly2018-02-22Paper
Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays2018-01-19Paper
https://portal.mardi4nfdi.de/entity/Q53650652017-09-29Paper
Self-attraction removal from oritatami systems2017-08-31Paper
Rule set design problems for oritatami systems2017-05-18Paper
Binary pattern tile set synthesis is NP-hard2017-05-11Paper
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis2017-02-22Paper
The extended equation of Lyndon and Schützenberger2016-12-28Paper
Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence2016-11-30Paper
The Complexity of Fixed-Height Patterned Tile Self-assembly2016-11-09Paper
https://portal.mardi4nfdi.de/entity/Q57404222016-07-26Paper
Semilinear Sets and Counter Machines: a Brief Survey2016-05-11Paper
On computational complexity of graph inference from counting2016-04-06Paper
Dynamic simulation of 1D cellular automata in the Active aTAM2016-04-01Paper
Square-Density Increasing Mappings2015-11-04Paper
Binary pattern tile set synthesis is NP-hard2015-10-27Paper
Program size and temperature in self-assembly2015-09-02Paper
A Stronger Square Conjecture on Binary Words2015-01-13Paper
Generalised Lyndon-Schützenberger Equations2014-10-14Paper
https://portal.mardi4nfdi.de/entity/Q31915682014-10-06Paper
Operational State Complexity under Parikh Equivalence2014-08-07Paper
3-Color Bounded Patterned Self-assembly2014-07-07Paper
On the Behavior of Tile Assembly System at High Temperatures2014-04-30Paper
Transfer matrix analysis of one-dimensional majority cellular automata with thermal noise2014-04-11Paper
Computing Minimum Tile Sets to Self-Assemble Color Patterns2014-01-14Paper
On the open problem of Ginsburg concerning semilinear sets and related problems2014-01-10Paper
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata2013-12-19Paper
Combinatorial Optimization in Pattern Assembly2013-06-28Paper
CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES2013-06-06Paper
On the Boundedness Property of Semilinear Sets2013-05-28Paper
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata2012-11-02Paper
One-reversal counter machines and multihead automata: revisited2012-10-11Paper
SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED2012-08-29Paper
On the Behavior of Tile Assembly System at High Temperatures2012-08-14Paper
Triangular and Hexagonal Tile Self-assembly Systems2012-06-15Paper
Iterated Hairpin Completions of Non-crossing Words2012-06-15Paper
Absoluteness of subword inequality is undecidable2012-03-13Paper
Program Size and Temperature in Self-Assembly2011-12-16Paper
K-Comma Codes and Their Generalizations2011-11-22Paper
On the Regularity of Iterated Hairpin Completion of a Single Word2011-11-22Paper
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality2011-06-14Paper
An extension of the Lyndon-Schützenberger result to pseudoperiodic words2011-04-28Paper
PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS2011-03-30Paper
ORTHOGONAL SHUFFLE ON TRAJECTORIES2011-02-23Paper
Block insertion and deletion on trajectories2011-02-21Paper
One-Reversal Counter Machines and Multihead Automata: Revisited2011-02-15Paper
Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement2011-01-28Paper
Triangular Tile Self-assembly Systems2011-01-28Paper
Schema for Parallel Insertion and Deletion2010-08-31Paper
On a special class of primitive words2010-02-05Paper
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes2009-11-05Paper
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words2009-07-07Paper
Twin-roots of words and their properties2009-06-04Paper
On pseudoknot-bordered words and their properties2009-03-11Paper
On a Special Class of Primitive Words2009-02-03Paper
Duplication in DNA Sequences2008-10-30Paper
Grammatical Inference: Algorithms and Applications2006-10-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Shinnosuke Seki