Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient computation of maximal anti-exponent in palindrome-free strings |
scientific article; zbMATH DE number 6680850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computation of maximal anti-exponent in palindrome-free strings |
scientific article; zbMATH DE number 6680850 |
Statements
Efficient computation of maximal anti-exponent in palindrome-free strings (English)
0 references
6 February 2017
0 references
LZ-factorisation
0 references
suffix automaton
0 references
palindromes
0 references
0 references
0 references
