The pseudopalindromic completion of regular languages (Q476182): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: HAIRPIN LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hairpin Completion of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Hairpin Completions of Non-crossing Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some algorithmic problems regarding the hairpin completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Lengthening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Completion Versus Hairpin Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two complementary operations inspired by the DNA hairpin formation: Completion and reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME REMARKS ON THE HAIRPIN COMPLETION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded hairpin completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterated hairpin completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian words: structure, combinatorics, and their arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopalindrome closure operators in free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watson-Crick palindromes in DNA computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Completion with Bounded Stem-Loop / rank
 
Normal rank

Revision as of 08:36, 9 July 2024

scientific article
Language Label Description Also known as
English
The pseudopalindromic completion of regular languages
scientific article

    Statements

    The pseudopalindromic completion of regular languages (English)
    0 references
    0 references
    0 references
    0 references
    28 November 2014
    0 references
    pseudopalindromes
    0 references
    pseudopalindromic completion
    0 references
    pseudopalindromic iterated completion
    0 references
    regular languages
    0 references
    algorithms
    0 references
    decidability
    0 references

    Identifiers