Hairpin Languages

No abstract is available for this paper.

• Publication year

  2001

• Venue

  International Journal of Foundations of Computer Science

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1142/S0129054101000904
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Molecular computation by DNA hairpin formation.

  2000cited by this paper
• 2D DNA self-assembly for satisfiability

  1999cited by this paper
• Three dimensional DNA structures in computing.

  1999cited by this paper
• YAC: Yet another computation model of self-assembly

  1999influential reference
• DIMACS Series in Discrete Mathematics and Theoretical Computer Science Experimental Progress in Computation by Self-Assembly of DNA

  1999cited by this paper
• (DNA) computing by carving

  1999cited by this paper
• DNA computing, sticker systems, and universality

  1998cited by this paper
• Universal computation via self-assembly of DNA: Some theory and experiments

  1996cited by this paper
• Molecular computation of solutions to combinatorial problems.

  1994cited by this paper
• Normal forms for phrase-structure grammars

  1991cited by this paper
• A Purely Homomorphic Characterization of Recursively Enumerable Sets

  1979cited by this paper
• and as an in

  year unknowncited by this paper

• On combinatorial and biofunctional symmetries hidden in polynucleotide sequences

  2025cites this paper
• Primitivity of Atom Watson-Crick Fibonacci Words

  2022cites this paper
• Involutive Fibonacci Words

  2021cites this paper
• Hairpin completions and reductions: semilinearity properties

  2020cites this paper
• Further Properties of Self-assembly by Hairpin Formation

  2019cites this paper
• Networks of Bio-inspired Processors

  2018cites this paper
• Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words

  2016cites this paper
• Engineering multistate DNA molecules: a tunable thermal band-pass filter

  2016cites this paper
• A Study of Pseudo-Periodic and Pseudo-Bordered Words for Functions Beyond Identity and Involution

  2015cites this paper
• Hairpin lengthening: language theoretic and algorithmic results

  2015cites this paper
• Toehold DNA Languages are Regular

  2015cites this paper
• Generating the Pseudo-Powers of a Word

  2014cites this paper
• Pseudo-Identities and Bordered Words

  2014cites this paper
• The pseudopalindromic completion of regular languages

  2014cites this paper
• Hairpin Lengthening and Shortening of Regular Languages

  2012cites this paper
• Languages Alive

  2012cites this paper
• On the Hairpin Incompletion

  2011cites this paper
• Iterated Hairpin Completions of Non-crossing Words

  2011cites this paper
• On the Regularity of Iterated Hairpin Completion of a Single Word

  2011cites this paper
• Iterated Hairpin Completions of Non-crossing Words

  2011cites this paper
• DNA Computing : Foundations and Implications ∗

  2010cites this paper
• Properties of Pseudo-Primitive Words and their Applications

  2010cites this paper
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

  2009cites this paper
• The syntactic monoid of hairpin-free languages

  2007cites this paper
• Superposition Based on Watson–Crick-Like Complementarity

  2006cites this paper