Shinnosuke Seki

According to our database1, Shinnosuke Seki
  • authored at least 82 papers between 2004 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Nondeterministic seedless oritatami systems and hardness of testing their equivalence.
Natural Computing, 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. Inform., 2017

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

Self-attraction Removal from Oritatami Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

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

The Complexity of Fixed-Height Patterned Tile Self-Assembly.
CoRR, 2016

The Complexity of Fixed-Height Patterned Tile Self-assembly.
Proceedings of the Implementation and Application of Automata, 2016

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

Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence.
Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

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

3-color bounded patterned self-assembly.
Natural Computing, 2015

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

Efficient Universal Computation by Greedy Molecular Folding.
CoRR, 2015

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

Binary Pattern Tile Set Synthesis Is NP-hard.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

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

2014
Binary pattern tile set synthesis is NP-hard.
CoRR, 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 of Computing, 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.
Natural Computing, 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

3-color Bounded Patterned Self-assembly.
CoRR, 2013

On the Behavior of Tile Assembly System at High Temperatures.
Computability, 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

Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata
CoRR, 2012

On the behavior of tile assembly system at high temperatures
CoRR, 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

On the Behavior of Tile Assembly System at High Temperatures.
Proceedings of the How the World Computes, 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. Inform., 2011

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

Iterated Hairpin Completions of Non-crossing Words
CoRR, 2011

Absoluteness of subword inequality is undecidable
CoRR, 2011

On the regularity of iterated hairpin completion of a single word
CoRR, 2011

One-Reversal Counter Machines and Multihead Automata: Revisited.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

The Power of Nondeterminism in Self-Assembly.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Program Size and Temperature in Self-Assembly.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines.
Proceedings of the Automata and Formal Languages, 13th International Conference, 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. Inform., 2010

Parallelism, Program Size, Time, and Temperature in Self-Assembly.
Electronic Colloquium on Computational Complexity (ECCC), 2010

The Power of Nondeterminism in Self-Assembly.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Parallelism, Program Size, Time, and Temperature in Self-Assembly
CoRR, 2010

The Power of Nondeterminism in Self-Assembly
CoRR, 2010

Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement
CoRR, 2010

Triangular Self-Assembly
CoRR, 2010

Properties of Pseudo-Primitive Words and their Applications
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

An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

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

2008
On a Special Class of Primitive Words.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Duplication in DNA Sequences.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2005
A Grammatical Approach to the Alignment of Structure-Annotated Strings.
IEICE Transactions, 2005

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


  Loading...