Pages that link to "Item:Q2641875"
From MaRDI portal
The following pages link to The syntactic monoid of hairpin-free languages (Q2641875):
Displaying 8 items.
- Semigroup theory of symmetry (Q338184) (← links)
- On iterated hairpin completion (Q551189) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- On pseudoknot-bordered words and their properties (Q1004600) (← links)
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (Q3073627) (← links)
- IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR (Q3224950) (← links)
- WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID (Q3542877) (← links)
- Watson-Crick palindromes in DNA computing (Q5962061) (← links)
