Shinnosuke Seki

Orcid: 0000-0002-0276-3322

According to our database1, Shinnosuke Seki authored at least 80 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Programmable single-stranded architectures for computing.
Nat. Comput., September, 2023

Freezing 1-Tag Systems with States.
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022
Preface to Hagiya-sensei's 2<sup>6</sup>-th Birthday Special Issue.
New Gener. Comput., 2022

Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM).
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
A general architecture of oritatami systems for simulating arbitrary finite automata.
Theor. Comput. Sci., 2021

Square network on a word.
Theor. Comput. Sci., 2021

Preface.
Nat. Comput., 2021

Counting infinitely by oritatami co-transcriptional folding.
Nat. Comput., 2021

Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami.
Int. J. Found. Comput. Sci., 2021

2020
Renewal of the Major Fields of New Generation Computing Vol. 38 (2020).
New Gener. Comput., 2020

Transcript design problem of oritatami systems.
Nat. Comput., 2020

Special Issue Developments in Language Theory 2018 - Preface.
Int. J. Found. Comput. Sci., 2020

Simple Intrinsic Simulation of Cellular Automata in Oritatami Molecular Folding Model.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Self-Attraction Removal from Oritatami Systems.
Int. J. Found. Comput. Sci., 2019

On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence.
Proceedings of the Theory and Applications of Models of Computation, 2019

Single-Stranded Architectures for Computing.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018
Nondeterministic seedless oritatami systems and hardness of testing their equivalence.
Nat. Comput., 2018

Towards the Algorithmic Molecular Self-assembly of Fractals by Cotranscriptional Folding.
Proceedings of the Implementation and Application of Automata, 2018

Proving the Turing Universality of Oritatami Co-Transcriptional Folding.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Know When to Fold 'Em: Self-assembly of Shapes by Folding in Oritatami.
Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

2017
Rule set design problems for oritatami systems.
Theor. Comput. Sci., 2017

The extended equation of Lyndon and Schützenberger.
J. Comput. Syst. Sci., 2017

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis.
J. Comb. Optim., 2017

The Complexity of Fixed-Height Patterned Tile Self-Assembly.
Int. J. Found. Comput. Sci., 2017

Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays.
Fundam. Informaticae, 2017

Binary Pattern Tile Set Synthesis Is NP-Hard.
Algorithmica, 2017

2016
Patterned Self-Assembly Tile Set Synthesis.
Encyclopedia of Algorithms, 2016

Programming Biomolecules That Fold Greedily During Transcription.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Dynamic Simulation of 1D Cellular Automata in the Active aTAM.
New Gener. Comput., 2015

3-color bounded patterned self-assembly.
Nat. Comput., 2015

Semilinear Sets and Counter Machines: a Brief Survey.
Fundam. Informaticae, 2015

Efficient Universal Computation by Greedy Molecular Folding.
CoRR, 2015

Program Size and Temperature in Self-Assembly.
Algorithmica, 2015

Square-Density Increasing Mappings.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis.
CoRR, 2014

Computing Minimum Tile Sets to Self-Assemble Colors Patterns.
CoRR, 2014

A Stronger Square Conjecture on Binary Words.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Generalised Lyndon-Schützenberger Equations.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Operational State Complexity under Parikh Equivalence.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
The Power of Nondeterminism in Self-Assembly.
Theory Comput., 2013

On the open problem of Ginsburg concerning semilinear sets and related problems.
Theor. Comput. Sci., 2013

On computational complexity of graph inference from counting.
Nat. Comput., 2013

Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata.
Inf. Comput., 2013

Combinatorial Optimization in Pattern Assembly
CoRR, 2013

Transfer matrix analysis of one-dimensional majority cellular automata with thermal noise.
CoRR, 2013

On the Behavior of Tile Assembly System at High Temperatures.
Comput., 2013

Combinatorial Optimization in Pattern Assembly - (Extended Abstract).
Proceedings of the Unconventional Computation and Natural Computation, 2013

On the Boundedness Property of Semilinear Sets.
Proceedings of the Theory and Applications of Models of Computation, 2013

Computing Minimum Tile Sets to Self-Assemble Color Patterns.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

3-Color Bounded Patterned Self-assembly - (Extended Abstract).
Proceedings of the DNA Computing and Molecular Programming - 19th International Conference, 2013

2012
DNA Computing - Foundations and Implications.
Proceedings of the Handbook of Natural Computing, 2012

Absoluteness of subword inequality is undecidable.
Theor. Comput. Sci., 2012

One-reversal counter machines and multihead automata: Revisited.
Theor. Comput. Sci., 2012

Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines.
Int. J. Found. Comput. Sci., 2012

Iterated Hairpin Completions of Non-crossing Words.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Triangular and Hexagonal Tile Self-assembly Systems.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Block insertion and deletion on trajectories.
Theor. Comput. Sci., 2011

Schema for Parallel Insertion and Deletion: Revisited.
Int. J. Found. Comput. Sci., 2011

Properties of Pseudo-Primitive Words and their Applications.
Int. J. Found. Comput. Sci., 2011

Orthogonal Shuffle on Trajectories.
Int. J. Found. Comput. Sci., 2011

An extension of the Lyndon-Schützenberger result to pseudoperiodic words.
Inf. Comput., 2011

On the Regularity of Iterated Hairpin Completion of a Single Word.
Fundam. Informaticae, 2011

K-Comma Codes and Their Generalizations.
Fundam. Informaticae, 2011

2010
On a special class of primitive words.
Theor. Comput. Sci., 2010

An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality.
Fundam. Informaticae, 2010

Parallelism, Program Size, Time, and Temperature in Self-Assembly.
Electron. Colloquium Comput. Complex., 2010

Triangular Self-Assembly
CoRR, 2010

Triangular Tile Self-assembly Systems.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

Schema for Parallel Insertion and Deletion.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Twin-roots of words and their properties.
Theor. Comput. Sci., 2009

On pseudoknot-bordered words and their properties.
J. Comput. Syst. Sci., 2009

On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

Duplication in DNA Sequences.
Proceedings of the Algorithmic Bioprocesses, 2009

2007
An Efficient Multiple Alignment Method for RNA Secondary Structures Including Pseudoknots.
Proceedings of the Natural Computing, 2007

Towards the Sequence Design Preventing Pseudoknot Formation.
Proceedings of the Natural Computing, 2007

2005
A Grammatical Approach to the Alignment of Structure-Annotated Strings.
IEICE Trans. Inf. Syst., 2005

2004
Efficient Learning of <i>k</i>-Reversible Context-Free Grammars from Positive Structural Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004


  Loading...