The syntactic monoid of hairpin-free languages

DOI10.1007/S00236-007-0041-4zbMATH Open1119.68107OpenAlexW1966644481WikidataQ62046618 ScholiaQ62046618MaRDI QIDQ2641875FDOQ2641875

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Outfix and infix codes and related classes of languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On free monoids partially ordered by embedding
• Title not available (Why is that?)
• Hairpin languages
• Hairpin Structures in DNA Words
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Linear splicing and syntactic monoid
• Sticky-free and overhang-free DNA languages
• The syntactic monoid of a hypercode
• Title not available (Why is that?)
• 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 (13)

• Title not available (Why is that?)
• Watson-Crick palindromes in DNA computing
• On pseudoknot-bordered words and their properties
• Title not available (Why is that?)
• On iterated hairpin completion
• Deciding regularity of hairpin completions of regular languages in polynomial time
• A formal language analysis of DNA hairpin structures
• It is NL-complete to decide whether a hairpin completion of regular languages is regular
• Title not available (Why is that?)
• Semigroup theory of symmetry
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• Developments in Language Theory
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)

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)