On the Hairpin Completion of Regular Languages
From MaRDI portal
Publication:3393406
DOI10.1007/978-3-642-03466-4_11zbMath1250.68153OpenAlexW1522798115MaRDI QIDQ3393406
Victor Mitrana, Volker Diekert, Steffen Kopecki
Publication date: 20 August 2009
Published in: Theoretical Aspects of Computing - ICTAC 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03466-4_11
Related Items (8)
Hairpin Lengthening and Shortening of Regular Languages ⋮ A series of algorithmic results related to the iterated hairpin completion ⋮ Testing DNA code words properties of regular languages ⋮ Language theoretical properties of hairpin formations ⋮ The pseudopalindromic completion of regular languages ⋮ On iterated hairpin completion ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time ⋮ Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
This page was built for publication: On the Hairpin Completion of Regular Languages
