scientific article; zbMATH DE number 7559452
From MaRDI portal
Publication:5089256
DOI10.4230/LIPICS.MFCS.2020.81MaRDI QIDQ5089256FDOQ5089256
Authors: Mikhail Rubinchik, Arseny M. Shur 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2002.03965
Title of this publication is not available (Why is that?)
Cites Work
- On the Complexity of Finite Sequences
- Fast Pattern Matching in Strings
- Uniqueness Theorems for Periodic Functions
- Title not available (Why is that?)
- On palindromic factorization of words
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Free differential calculus. IV: The quotient groups of the lower central series
- A subquadratic algorithm for minimum palindromic factorization
- A Linear-Time On-Line Recognition Algorithm for ``Palstar
- Computing palindromic factorizations and palindromic covers on-line
- \(\mathrm{Pal}^{k}\) is linear recognizable online
- Palindromic length in free monoids and free groups
- Sturmian numeration systems and decompositions to palindromes
- Palindromic length in linear time
- Diverse Palindromic Factorization Is NP-complete
- Factorizing a String into Squares in Linear Time
Cited In (2)
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)
