Palindromic length and reduction of powers (Q2166768): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Palindromic length of words and morphisms in class \(\mathcal{P}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic length in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Palindromic Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subquadratic algorithm for minimum palindromic factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On palindromic factorization of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian numeration systems and decompositions to palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: First lower bounds for palindromic length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Palindromic Factorizations and Palindromic Covers On-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: EERTREE: an efficient data structure for processing palindromes in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic length of words with many periodic palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic length in free monoids and free groups / rank
 
Normal rank

Revision as of 22:38, 29 July 2024

scientific article
Language Label Description Also known as
English
Palindromic length and reduction of powers
scientific article

    Statements

    Identifiers