The following pages link to Shinnosuke Seki (Q264985):
Displaying 50 items.
- Dynamic simulation of 1D cellular automata in the Active aTAM (Q264986) (← links)
- On computational complexity of graph inference from counting (Q269786) (← links)
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- On the open problem of Ginsburg concerning semilinear sets and related problems (Q391304) (← links)
- Program size and temperature in self-assembly (Q494811) (← links)
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Rule set design problems for oritatami systems (Q529023) (← links)
- Block insertion and deletion on trajectories (Q627169) (← links)
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
- The extended equation of Lyndon and Schützenberger (Q730507) (← links)
- Absoluteness of subword inequality is undecidable (Q764348) (← links)
- On a special class of primitive words (Q844893) (← links)
- On pseudoknot-bordered words and their properties (Q1004600) (← links)
- Twin-roots of words and their properties (Q1019719) (← links)
- Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding (Q1616981) (← links)
- Know when to fold 'em: self-assembly of shapes by folding in oritatami (Q1621127) (← links)
- Transcript design problem of oritatami systems (Q1621140) (← links)
- 3-color bounded patterned self-assembly (Q2003474) (← links)
- Simple intrinsic simulation of cellular automata in oritatami molecular folding model (Q2081643) (← links)
- Square network on a word (Q2243587) (← links)
- On the power of oritatami cotranscriptional folding with unary bead sequence (Q2327469) (← links)
- Single-stranded architectures for computing (Q2327537) (← links)
- Self-attraction removal from oritatami systems (Q2400999) (← links)
- Semilinear sets and counter machines: a brief survey (Q2805446) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
- Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence (Q2835701) (← links)
- Computing Minimum Tile Sets to Self-Assemble Color Patterns (Q2872134) (← links)
- Triangular and Hexagonal Tile Self-assembly Systems (Q2891326) (← links)
- Iterated Hairpin Completions of Non-crossing Words (Q2891380) (← links)
- On the Behavior of Tile Assembly System at High Temperatures (Q2904451) (← links)
- Schema for parallel insertion and deletion: revisited (Q2909102) (← links)
- Generalised Lyndon-Schützenberger Equations (Q2922033) (← links)
- A Stronger Square Conjecture on Binary Words (Q2938111) (← links)
- An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality (Q3008098) (← links)
- Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement (Q3070960) (← links)
- Triangular Tile Self-assembly Systems (Q3070964) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
- ORTHOGONAL SHUFFLE ON TRAJECTORIES (Q3076614) (← links)
- PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS (Q3086250) (← links)
- K-Comma Codes and Their Generalizations (Q3100171) (← links)
- On the Regularity of Iterated Hairpin Completion of a Single Word (Q3100937) (← links)
- Program Size and Temperature in Self-Assembly (Q3104639) (← links)
- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (Q3167503) (← links)
- (Q3191568) (← links)
- Counting Infinitely by Oritatami Co-transcriptional Folding (Q3297785) (← links)
- Square-Density Increasing Mappings (Q3449366) (← links)
- Duplication in DNA Sequences (Q3533029) (← links)
- Schema for Parallel Insertion and Deletion (Q3584899) (← links)
