Hairpin Lengthening and Shortening of Regular Languages

DOI10.1007/978-3-642-31644-9_10zbMath1367.68174OpenAlexW187788765MaRDI QIDQ3166949

Florin Manea, Robert Mercaş, Victor Mitrana

Publication date: 1 November 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Hairpin completions and reductions: semilinearity properties ⋮ Language theoretical properties of hairpin formations ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time

Cites Work

• Language theoretical properties of hairpin formations
• On iterated hairpin completion
• Bounded hairpin completion
• A series of algorithmic results related to the iterated hairpin completion
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
• On some algorithmic problems regarding the hairpin completion
• Superposition based on Watson-Crick-like complementarity
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
• On the Hairpin Completion of Regular Languages
• Hairpin lengthening: language theoretic and algorithmic results
• Hairpin Lengthening
• HAIRPIN LANGUAGES
• Hairpin Completion Versus Hairpin Reduction
• Developments in Language Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hairpin Lengthening and Shortening of Regular Languages