StringologyTimes
DLT for Stringologist
DLT 2023
Bit Catastrophes for the Burrows-Wheeler Transform.
DLT 2022
Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words.
Prefix Palindromic Length of the Sierpinski Word.
DLT 2021
Weighted Prefix Normal Words: Mind the Gap.
Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings.
DLT 2020
Scattered Factor-Universality of Words.
DLT 2019
Separating Many Words by Counting Occurrences of Factors.
On Palindromic Length of Sturmian Sequences.
On the Length of Shortest Strings Accepted by Two-Way Finite Automata.
Computing the k-binomial Complexity of the Thue-Morse Word.
k-Spectra of Weakly-c-Balanced Words.
The Relative Edit-Distance Between Two Input-Driven Languages.
First Lower Bounds for Palindromic Length.
DLT 2018
The Runs Theorem and Beyond.
Block Sorting-Based Transformations on Words: Beyond the Magic BWT.
DLT 2017
On the Number of Rich Words.
DLT 2016
Ternary Square-Free Partial Words with Many Wildcards.
DLT 2015
Squareable Words.
Grammar-Based Tree Compression.
Transfinite Lyndon Words.
State Complexity of Neighbourhoods and Approximate Pattern Matching.
Diverse Palindromic Factorization Is NP-complete.
Unary Patterns with Permutations.