Hairpin completions and reductions: semilinearity properties

No abstract is available for this paper.

• Publication year

  2020

• Venue

  Natural Computing

• Publication date

  2020-06-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s11047-020-09797-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Properties

  2021cited by this paper
• Further Properties of Self-assembly by Hairpin Formation

  2019influential reference
• On the overlap assembly of strings and languages

  2017cited by this paper
• Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words

  2016cited by this paper
• Hairpin lengthening: language theoretic and algorithmic results

  2015cited by this paper
• Deterministic function computation with chemical reaction networks

  2012cited by this paper
• Hairpin Lengthening and Shortening of Regular Languages

  2012influential reference
• Bounded hairpin completion

  2011cited by this paper
• A series of algorithmic results related to the iterated hairpin completion

  2010cited by this paper
• On the Iterated Hairpin Completion

  2010cited by this paper
• Parikh Images of Grammars: Complexity and Applications

  2010cited by this paper
• Some Remarks on Superposition Based on Watson-Crick-Like Complementarity

  2009influential reference
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

  2009cited by this paper
• Self-assembly of strings and languages

  2007cited by this paper
• On some algorithmic problems regarding the hairpin completion

  2006cited by this paper
• Superposition Based on Watson–Crick-Like Complementarity

  2006cited by this paper
• On Hairpin-Free Words and Languages

  2005cited by this paper
• Some Remarks on Hairpin and Loop Languages

  2001cited by this paper
• Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin

  2001cited by this paper
• Hairpin Languages

  2001cited by this paper
• Molecular computation by DNA hairpin formation.

  2000cited by this paper
• Handbook of Formal Languages

  1997cited by this paper
• Handbook of formal languages, vol. 3: beyond words

  1997cited by this paper
• Good encodings for DNA-based solutions to combinatorial problems

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

  1996cited by this paper
• On numerical semigroups

  1986cited by this paper
• Parikh-Bounded Languages

  1981cited by this paper
• A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic

  1978cited by this paper
• A simplified proof of Parikh's theorem

  1977cited by this paper
• AFL with the Semilinear Property

  1971cited by this paper
• Semigroups, Presburger formulas, and languages.

  1966cited by this paper
• On Context-Free Languages

  1966influential reference

• Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor

  2023cites this paper
• Most Pseudo-copy Languages Are Not Context-Free

  2021cites this paper