SOME REMARKS ON THE HAIRPIN COMPLETION
From MaRDI portal
Publication:3056283
DOI10.1142/S0129054110007593zbMath1213.68356MaRDI QIDQ3056283
Florin Manea, Takashi Yokomori, Victor Mitrana
Publication date: 11 November 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)
Related Items
Iterated Hairpin Completions of Non-crossing Words, IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR, Language theoretical properties of hairpin formations, The pseudopalindromic completion of regular languages, On iterated hairpin completion, Bounded hairpin completion, Deciding regularity of hairpin completions of regular languages in polynomial time, Bounded Hairpin Completion
Cites Work