| 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 |
Freezing 1-Tag Systems with States
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Sweep complexity revisited
Implementation and Application of Automata | 2024-02-28 | Paper |
The effect of jumping modes on various automata models
Natural Computing | 2024-02-16 | Paper |
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Clusters of repetition roots forming prefix chains
| 2023-01-18 | Paper |
scientific article; zbMATH DE number 7584599 (Why is no real title available?)
| 2022-09-14 | Paper |
Clusters of repetition roots: single chains
| 2022-03-24 | Paper |
Square network on a word
Theoretical Computer Science | 2021-11-11 | Paper |
Two-way jumping automata
| 2021-07-08 | Paper |
Two-way deterministic automata with jumping mode
Theoretical Computer Science | 2021-04-08 | Paper |
On the prefix-suffix duplication reduction
International Journal of Foundations of Computer Science | 2020-02-21 | Paper |
Enhancement of automata with jumping modes
| 2019-12-05 | Paper |
On the power of oritatami cotranscriptional folding with unary bead sequence
| 2019-10-15 | Paper |
On Chomsky hierarchy of palindromic languages
Acta Cybernetica | 2016-09-09 | Paper |
One-way jumping finite automata
International Journal of Foundations of Computer Science | 2016-07-27 | Paper |
Palindromes and primitivity
| 2016-07-26 | Paper |
On computational complexity of graph inference from counting
Natural Computing | 2016-04-06 | Paper |
The pseudopalindromic completion of regular languages
Information and Computation | 2014-11-28 | Paper |
A note on the decidability of subword inequalities
International Journal of Foundations of Computer Science | 2013-10-23 | Paper |
On non-primitive palindromic context-free languages
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Hairpin completion with bounded stem-loop
Developments in Language Theory | 2012-11-02 | Paper |
POWERS OF REGULAR LANGUAGES
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
NUMBER OF OCCURRENCES OF POWERS IN STRINGS
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
Scattered subword complexity of non-primitive words
| 2009-08-10 | Paper |
Powers of Regular Languages
Developments in Language Theory | 2009-07-07 | Paper |
Bounds on Powers in Strings
Developments in Language Theory | 2008-10-30 | Paper |
ON INEQUALITIES BETWEEN SUBWORD HISTORIES
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
The power of programmed grammars with graphs from various classes
Journal of Applied Mathematics and Computing | 2006-12-04 | Paper |
