| Publication | Date of Publication | Type |
|---|
On the binary digits of \(n\) and \(n^2\)
Theoretical Computer Science | 2022-11-17 | Paper |
On the overlap assembly of strings and languages
Natural Computing | 2019-07-10 | Paper |
3-color bounded patterned self-assembly
Natural Computing | 2019-07-08 | Paper |
Efficient algorithms for computing the inner edit distance of a regular language via transducers
Algorithms | 2019-01-21 | Paper |
Transducer descriptions of DNA code properties and undecidability of antimorphic problems
Information and Computation | 2018-03-21 | Paper |
Binary pattern tile set synthesis is NP-hard
Algorithmica | 2017-05-11 | Paper |
Further remarks on DNA overlap assembly
Information and Computation | 2017-03-16 | Paper |
Deciding whether a regular language is generated by a splicing system
Journal of Computer and System Sciences | 2016-11-14 | Paper |
A formal language model of DNA polymerase enzymatic activity
Fundamenta Informaticae | 2016-05-11 | Paper |
Methods for relativizing properties of codes
Acta Cybernetica | 2016-05-03 | Paper |
Binary pattern tile set synthesis is NP-hard
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Transducer descriptions of DNA code properties and undecidability of antimorphic problems
Lecture Notes in Computer Science | 2015-08-07 | Paper |
Hypergraph automata: a theoretical model for patterned self-assembly
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
On the maximality of languages with combined types of code properties
Theoretical Computer Science | 2014-08-26 | Paper |
3-color bounded patterned self-assembly (extended abstract)
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Hypergraph automata: a theoretical model for patterned self-assembly
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Deciding whether a regular language is generated by a splicing system
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation | 2012-10-11 | Paper |
Iterated hairpin completions of non-crossing words
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Language theoretical properties of hairpin formations
Theoretical Computer Science | 2012-05-30 | Paper |
It is NL-complete to decide whether a hairpin completion of regular languages is regular
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
On the regularity of iterated hairpin completion of a single word
Fundamenta Informaticae | 2011-11-22 | Paper |
On iterated hairpin completion
Theoretical Computer Science | 2011-07-14 | Paper |
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
Implementation and Application of Automata | 2011-02-11 | Paper |
On the iterated hairpin completion
Developments in Language Theory | 2010-08-31 | Paper |
On the Hairpin Completion of Regular Languages
Theoretical Aspects of Computing - ICTAC 2009 | 2009-08-20 | Paper |
