A relation by palindromic subwords (Q609026): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62046603, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a Special Class of Primitive Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relation by palindromic subwords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopalindrome closure operators in free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: INVOLUTIVELY BORDERED WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watson-Crick Conjugate and Commutative Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watson-Crick palindromes in DNA computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome words and reverse closed languages / rank
 
Normal rank

Latest revision as of 13:19, 3 July 2024

scientific article
Language Label Description Also known as
English
A relation by palindromic subwords
scientific article

    Statements

    A relation by palindromic subwords (English)
    0 references
    0 references
    0 references
    30 November 2010
    0 references
    0 references
    DNA encodings
    0 references
    combinatorics of words
    0 references
    palindromes
    0 references
    insertion/deletion
    0 references
    Watson-Crick palindromes
    0 references
    0 references
    0 references