Spinal Cellular Automata. - Natasa Jonoska (ICCI, 1992)

Minimal presentations for irreducible sofic shifts. - Natasa Jonoska; Brian H. Marcus (IEEE Trans. Inf. Theory, 1994)

A molecular computation of the road coloring problem. - Natasa Jonoska; Stephen A. Karl (DNA Based Computers, 1996)

Sofic Shifts with Synchronizing Presentations. - Natasa Jonoska (Theor. Comput. Sci., 1996)

Creating 3-dimensional graph structures with DNA. - Natasa Jonoska; Stephen A. Karl; Masahico Saito (DNA Based Computers, 1997)

Ligation experiments in computing with DNA. - Natasa Jonoska; Stephen A. Karl (ICEC, 1997)

On a class of Nth order digital filters operating outside the region of stability. - Cvetko D. Mitrovski; Ljupco Kocarev; Natasa Jonoska (Int. J. Circuit Theory Appl., 1998)

Boundary Components of Thickened Graphs. - Natasa Jonoska; Masahico Saito (DNA, 2001)

Multiplicities of covers for sofic shifts. - Doris Fiebig; Ulf-Rainer Fiebig; Natasa Jonoska (Theor. Comput. Sci., 2001)

Generating DNA Code Words. - Natasa Jonoska; David Kephart; Kalpana Mahalingam (GECCO Late Breaking Papers, 2002)

DNA Hybridization, Shifts of Finite Type, and Tiling of the Integers. - Ethan M. Coven; Natasa Jonoska (Grammars and Automata for String Processing, 2003)

Languages of DNA Based Code Words. - Natasa Jonoska; Kalpana Mahalingam (DNA, 2003)

Tiling Rectangular Pictures with P Systems. - Rodica Ceterchi; Radu Gramatovici; Natasa Jonoska (Workshop on Membrane Computing, 2003)

Tissue-like P Systems with Active Membranes for Picture Generation. - Rodica Ceterchi; Radu Gramatovici; Natasa Jonoska; K. G. Subramanian 001 (Fundam. Informaticae, 2003)

Computation by Self-assembly of DNA Graphs. - Natasa Jonoska; Phiset Sa-Ardyen; Nadrian C. Seeman (Genet. Program. Evolvable Mach., 2003)

Forbidding and enforcing in membrane computing. - Matteo Cavaliere; Natasa Jonoska (Nat. Comput., 2003)

Self-assembling DNA graphs. - Phiset Sa-Ardyen; Natasa Jonoska; Nadrian C. Seeman (Nat. Comput., 2003)

Transducers with Programmable Input by DNA Self-assembly. - Natasa Jonoska; Shiping Liao; Nadrian C. Seeman (Aspects of Molecular Computing, 2004)

Methods for Constructing Coded DNA Languages. - Natasa Jonoska; Kalpana Mahalingam (Aspects of Molecular Computing, 2004)

Algebraic and Topological Models for DNA Recombinant Processes. - Natasa Jonoska; Masahico Saito (Developments in Language Theory, 2004)

Biomolecular Implementation of Computing Devices with Unbounded Memory. - Matteo Cavaliere; Natasa Jonoska; Sivan Yogev; Ron Piran; Ehud Keinan; Nadrian C. Seeman (DNA, 2004)

lambda-P Systems and Typed lambda-Calculus. - Loïc Colson; Natasa Jonoska; Maurice Margenstern (Workshop on Membrane Computing, 2004)

Tree Operations in P Systems and lamda-Calculus. - Natasa Jonoska; Maurice Margenstern (Fundam. Informaticae, 2004)

Trends in Computing with DNA. - Natasa Jonoska (J. Comput. Sci. Technol., 2004)

Membrane Computing. - Natasa Jonoska; Gheorghe Paun (New Gener. Comput., 2004)

Recognizing DNA Splicing. - Matteo Cavaliere; Natasa Jonoska; Peter Leupold (DNA, 2005)

Expectation and Variance of Self-assembled Graph Structures. - Natasa Jonoska; Gregory L. McColm; Ana Staninska (DNA, 2005)

A Computational Model for Self-assembling Flexible Tiles. - Natasa Jonoska; Gregory L. McColm (UC, 2005)

Structural DNA Nanotechnology: Molecular Construction and Computation. - Ruojie Sha; Xiaoping Zhang; Shiping Liao; Pamela E. Constantinou; Baoquan Ding; Tong Wang; Alejandra V. Garibotti; Hong Zhong; Lisa B. Israel; Xing Wang; Gang Wu; Banani Chakraborty; et al. (UC, 2005)

Involution codes: with application to DNA coded languages. - Natasa Jonoska; Kalpana Mahalingam; Junghuei Chen (Nat. Comput., 2005)

Spectrum of a Pot for DNA Complexes. - Natasa Jonoska; Gregory L. McColm; Ana Staninska (DNA, 2006)

Forbidding - Enforcing Conditions in DNA Self-assembly of Graphs. - Giuditta Franco; Natasa Jonoska (Nanotechnology: Science and Computation, 2006)

Flexible Versus Rigid Tile Assembly. - Natasa Jonoska; Gregory L. McColm (UC, 2006)

Biomolecular Automata. - Natasa Jonoska (Bull. EATCS, 2006)

Theoretical and Experimental DNA Computation. - Natasa Jonoska (Genet. Program. Evolvable Mach., 2006)

Transitivity in Two-dimensional Local Languages Defined by Dot Systems. - Natasa Jonoska; Joni Burnette Pirnot (Int. J. Found. Comput. Sci., 2006)

Topological Properties of Forbidding-Enforcing Systems. - Daniela Genova; Natasa Jonoska (J. Autom. Lang. Comb., 2006)

Describing Self-assembly of Nanostructures. - Natasa Jonoska; Gregory L. McColm (SOFSEM, 2008)

On Complexity of Two Dimensional Languages Generated by Transducers. - Egor Dolzhenko; Natasa Jonoska (CIAA, 2008)

Knee joint injury and repair modeled by membrane systems. - Giuditta Franco; Natasa Jonoska; Barbara Osborn; Anna Plaas (Biosyst., 2008)

Involution Solid and Join codes. - Natasa Jonoska; Lila Kari; Kalpana Mahalingam (Fundam. Informaticae, 2008)

Strategies for RNA-Guided DNA Recombination. - Angela Angeleska; Natasa Jonoska; Masahico Saito; Laura F. Landweber (Algorithmic Bioprocesses, 2009)

DNA Cages with Icosahedral Symmetry in Bionanotechnology. - Natasa Jonoska; Anne Taormina; Reidun Twarock (Algorithmic Bioprocesses, 2009)

Framed Versus Unframed Two-Dimensional Languages. - Marcella Anselmo; Natasha Jonoska; Maria Madonia (SOFSEM, 2009)

Construction of a DNA nano-object directly demonstrates computation. - Gang Wu; Natasha Jonoska; Nadrian C. Seeman (Biosyst., 2009)

DNA recombination through assembly graphs. - Angela Angeleska; Natasa Jonoska; Masahico Saito (Discret. Appl. Math., 2009)

DNA splicing: computing by observing. - Matteo Cavaliere; Natasa Jonoska; Peter Leupold (Nat. Comput., 2009)

Preface. - Natasa Jonoska; Jarkko Kari (Theor. Comput. Sci., 2009)

Complexity classes for self-assembling flexible tiles. - Natasa Jonoska; Gregory L. McColm (Theor. Comput. Sci., 2009)

Finite state automata representing two-dimensional subshifts. - Natasa Jonoska; Joni Burnette Pirnot (Theor. Comput. Sci., 2009)

On existence of reporter strands in DNA-based graph structures. - Natasa Jonoska; Nadrian C. Seeman; Gang Wu (Theor. Comput. Sci., 2009)

DNA Rearrangements through Spatial Graphs. - Natasa Jonoska; Masahico Saito (CiE, 2010)

Finite State Automata by DNA Self-assembly. - Natasa Jonoska; Nadrian C. Seeman (ICT Innovations, 2010)

Using Automata to Describe Self-Assembled Nanostructures. - Natasa Jonoska (CIAA, 2010)

Transducer generated arrays of robotic nano-arms. - Egor Dolzhenko; Natasa Jonoska; Nadrian C. Seeman (Nat. Comput., 2010)

Regular Splicing Languages Must Have a Constant. - Paola Bonizzoni; Natasha Jonoska (Developments in Language Theory, 2011)

On stoichiometry for the assembly of flexible tile DNA complexes. - Natasha Jonoska; Gregory L. McColm; Ana Staninska (Nat. Comput., 2011)

Active Tile Self-assembly, Self-similar Structures and Recursion - Natasha Jonoska; Daria Karpenko (CoRR, 2012)

Two-Dimensional Languages and Cellular Automata. - Egor Dolzhenko; Natasa Jonoska (Int. J. Found. Comput. Sci., 2012)

Rewriting rule chains modeling DNA rearrangement pathways. - Angela Angeleska; Natasa Jonoska; Masahico Saito (Theor. Comput. Sci., 2012)

Forbidding and enforcing on graphs. - Daniela Genova; Natasa Jonoska (Theor. Comput. Sci., 2012)

Computational Nature of Gene Assembly in Ciliates. - Robert Brijder; Mark Daley; Tero Harju; Natasa Jonoska; Ion Petre; Grzegorz Rozenberg (Handbook of Natural Computing, 2012)

Four-regular graphs with rigid vertices associated to DNA recombination. - Jonathan Burns; Egor Dolzhenko; Natasa Jonoska; Tilahun Muche; Masahico Saito (Discret. Appl. Math., 2013)

A Stronger Square Conjecture on Binary Words. - Natasa Jonoska; Florin Manea; Shinnosuke Seki 001 (SOFSEM, 2014)

Languages Associated with Crystallographic Symmetry. - Natasa Jonoska; Mile Krajcevski; Gregory L. McColm (UCNC, 2014)

Active Tile Self-assembly, Part 1: Universality at temperature 1. - Natasa Jonoska; Daria Karpenko (Int. J. Found. Comput. Sci., 2014)

Active Tile Self-assembly, Part 2: Self-Similar Structures and Structural Recursion. - Natasa Jonoska; Daria Karpenko (Int. J. Found. Comput. Sci., 2014)

Preface. - Jérôme Durand-Lose; Natasa Jonoska (Nat. Comput., 2014)

Genus Ranges of 4-Regular Rigid Vertex Graphs. - Dorothy Buck; Egor Dolzhenko; Natasa Jonoska; Masahico Saito; Karin Valencia (Electron. J. Comb., 2015)

Existence of constants in regular splicing languages. - Paola Bonizzoni; Natasa Jonoska (Inf. Comput., 2015)

Dynamic Simulation of 1D Cellular Automata in the Active aTAM. - Natasa Jonoska; Daria Karpenko; Shinnosuke Seki 001 (New Gener. Comput., 2015)

Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets. - Natasa Jonoska; Milé Krajcevski; Gregory L. McColm (UCNC, 2016)

<mds_ies_db>: a database of ciliate genome rearrangements. - Jonathan Burns; Denys Kukushkin; Kelsi Lindblad; Xiao Chen; Natasa Jonoska; Laura F. Landweber (Nucleic Acids Res., 2016)

Counter machines and crystallographic structures. - Natasa Jonoska; Mile Krajcevski; Gregory L. McColm (Nat. Comput., 2016)

Platform Color Designs for Interactive Molecular Arrangements. - Jasper Braun; Daniel A. Cruz; Natasa Jonoska (UCNC, 2017)

Patterns and Distances in Words Related to DNA Rearrangement. - Natasa Jonoska; Lukas Nabergall; Masahico Saito (Fundam. Informaticae, 2017)

A graph isomorphism condition and equivalence of reaction systems. - Daniela Genova; Hendrik Jan Hoogeboom; Natasa Jonoska (Theor. Comput. Sci., 2017)

Transformations on Double Occurrence Words Motivated by DNA Rearrangement. - Daniel A. Cruz; Margherita Maria Ferrari; Natasa Jonoska; Lukas Nabergall; Masahico Saito (CoRR, 2018)

Obituary for Tom Head. - Natasha Jonoska; Gheorghe Paun; Grzegorz Rozenberg (Bull. EATCS, 2018)

Algebraic Systems Motivated by DNA Origami. - James Garrett; Natasa Jonoska; Hwee Kim; Masahico Saito (CAI, 2019)

DNA Origami Words and Rewriting Systems. - James Garrett; Natasa Jonoska; Hwee Kim; Masahico Saito (UCNC, 2019)

Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute. - Jérôme Durand-Lose; Hendrik Jan Hoogeboom; Natasa Jonoska (CoRR, 2019)

The Topology of Scaffold Routings on Non-Spherical Mesh Wireframes. - Abdulmelik Mohammed; Natasa Jonoska; Masahico Saito (DNA, 2020)

Insertions Yielding Equivalent Double Occurrence Words. - Daniel A. Cruz; Margherita Maria Ferrari; Natasa Jonoska; Lukas Nabergall; Masahico Saito (Fundam. Informaticae, 2020)

Companions and an Essential Motion of a Reaction System. - Daniela Genova; Hendrik Jan Hoogeboom; Natasa Jonoska (Fundam. Informaticae, 2020)

Symbol Separation in Double Occurrence Words. - Natasa Jonoska; Masahico Saito; Hwee Kim; Brad Mostowski (Int. J. Found. Comput. Sci., 2020)

Preface. - Natasa Jonoska; Dmytro Savchuk (Int. J. Found. Comput. Sci., 2021)

Preface. - David Doty; Rudolf Freund; Natasa Jonoska; Jarkko Kari (Nat. Comput., 2021)

DNA origami words, graphical structures and their rewriting systems. - James Garrett; Natasa Jonoska; Hwee Kim; Masahico Saito (Nat. Comput., 2021)

Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths. - Jérôme Durand-Lose; Hendrik Jan Hoogeboom; Natasa Jonoska (CoRR, 2022)

Tree polynomials identify a link between co-transcriptional R-loops and nascent RNA folding. - Pengyu Liu 003; Jacob Lusk; Natasa Jonoska; Mariel Vázquez (PLoS Comput. Biol., 2024)