Hairpin languages
From MaRDI portal
Publication:5249294
DOI10.1142/S0129054101000904zbMATH Open1319.68139MaRDI QIDQ5249294FDOQ5249294
Authors: Gheorghe Păun, Takashi Yokomori, Grzegorz Rozenberg 
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cited In (18)
- The syntactic monoid of hairpin-free languages
- Title not available (Why is that?)
- A series of algorithmic results related to the iterated hairpin completion
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- On some algorithmic problems regarding the hairpin completion
- A formal language analysis of DNA hairpin structures
- Some remarks on the hairpin completion
- Hairpin completions and reductions: semilinearity properties
- Hairpin structures defined by DNA trajectories
- The pseudopalindromic completion of regular languages
- Hairpin Structures Defined by DNA Trajectories
- Involutive Fibonacci words
- Developments in Language Theory
- Hairpin Lengthening and Shortening of Regular Languages
- Hairpin Structures in DNA Words
- Unravel Four Hairpins!
- Iterated hairpin completions of non-crossing words
This page was built for publication: Hairpin languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249294)
