scientific article; zbMATH DE number 7559452

DOI10.4230/LIPICS.MFCS.2020.81MaRDI QIDQ5089256zbMATH OpenFDO

Authors Mikhail Rubinchik, Arseny M. Shur

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/2002.03965

zbMATH Keywords

online algorithmstringologypalindromepalindromic factorization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3340123 (Why is no real title available?)
• A Linear-Time On-Line Recognition Algorithm for ``Palstar
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• A subquadratic algorithm for minimum palindromic factorization
• Computing palindromic factorizations and palindromic covers on-line
• Diverse Palindromic Factorization Is NP-complete
• Factorizing a String into Squares in Linear Time
• Fast Pattern Matching in Strings
• Free differential calculus. IV: The quotient groups of the lower central series
• On palindromic factorization of words
• On the Complexity of Finite Sequences
• Palindromic length in free monoids and free groups
• Palindromic length in linear time
• Sturmian numeration systems and decompositions to palindromes
• Uniqueness Theorems for Periodic Functions
• \(\mathrm{Pal}^{k}\) is linear recognizable online

Cited in

(2)

• A subquadratic algorithm for minimum palindromic factorization
• Minimal unique palindromic substrings after single-character substitution

This page was built for publication:

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