The syntactic monoid of hairpin-free languages

DOI10.1007/S00236-007-0041-4MaRDI QIDQ2641875zbMATH OpenOpenAlexWikidataFDO

Authors 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

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Developments in Language Theory
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• A formal language analysis of DNA hairpin structures
• Hairpin Structures in DNA Words
• Algebraic characterization of RNA operations for DNA-based computation

Cites work

• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Hairpin languages
• Hairpin Structures in DNA Words
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 4039328 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 1354855 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• Linear splicing and syntactic monoid
• On free monoids partially ordered by embedding
• Outfix and infix codes and related classes of languages
• Sticky-free and overhang-free DNA languages
• The syntactic monoid of a hypercode
• The Syntactic Monoid of an Infix Code
• The syntactic monoid of the semigroup generated by a comma-free code
• The syntactic monoid of the semigroup generated by a maximal prefix code

Cited in

(15)

• 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
• Semigroup theory of symmetry
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• scientific article; zbMATH DE number 4009840 (Why is no real title available?)
• scientific article; zbMATH DE number 522864 (Why is no real title available?)
• scientific article; zbMATH DE number 1150244 (Why is no real title available?)
• Developments in Language Theory
• A formal language analysis of DNA hairpin structures
• On iterated hairpin completion
• Watson-Crick palindromes in DNA computing
• Hairpin completion distance lower bound
• The syntactic monoid of -free palindromic words
• Deciding regularity of hairpin completions of regular languages in polynomial time

This page was built for publication: The syntactic monoid of hairpin-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641875)