The syntactic monoid of hairpin-free languages

DOI10.1007/s00236-007-0041-4zbMath1119.68107WikidataQ62046618 ScholiaQ62046618MaRDI QIDQ2641875

Lila Kari, Kalpana Mahalingam, Gabriel Thierrin

Publication date: 17 August 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-007-0041-4

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

Related Items

Watson-Crick palindromes in DNA computing, Semigroup theory of symmetry, On iterated hairpin completion, Deciding regularity of hairpin completions of regular languages in polynomial time, On pseudoknot-bordered words and their properties, Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract), IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR, WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outfix and infix codes and related classes of languages
• Sticky-free and overhang-free DNA languages
• Linear splicing and syntactic monoid
• The syntactic monoid of a hypercode
• The Syntactic Monoid of an Infix Code
• Hairpin Structures in DNA Words
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• The syntactic monoid of the semigroup generated by a comma-free code
• The syntactic monoid of the semigroup generated by a maximal prefix code
• HAIRPIN LANGUAGES
• On free monoids partially ordered by embedding