Developments in Language Theory

DOI10.1007/b137735zbMath1132.68451OpenAlexW4376562803MaRDI QIDQ5473680

Lila Kari, Petr Sosík, Stavros Konstantinidis, Gabriel Thierrin

Publication date: 23 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137735

zbMATH Keywords

DNA computingfinite automatoninvolutionDNA hairpin

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Hairpin Lengthening and Shortening of Regular Languages ⋮ A series of algorithmic results related to the iterated hairpin completion ⋮ Hairpin completions and reductions: semilinearity properties ⋮ Testing DNA code words properties of regular languages ⋮ On different generalizations of episturmian words ⋮ Bounded hairpin completion ⋮ Hairpin structures defined by DNA trajectories ⋮ On \(\theta\)-episturmian words ⋮ Two complementary operations inspired by the DNA hairpin formation: Completion and reduction ⋮ Bounded Hairpin Completion ⋮ Hairpin Structures in DNA Words ⋮ On some algorithmic problems regarding the hairpin completion

This page was built for publication: Developments in Language Theory