StringologyTimes

DLT for Stringologist

DLT 2023

  1. Bit Catastrophes for the Burrows-Wheeler Transform.

DLT 2022

  1. Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words.
  2. Prefix Palindromic Length of the Sierpinski Word.

DLT 2021

  1. Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings.
  2. Weighted Prefix Normal Words: Mind the Gap.

DLT 2020

  1. Scattered Factor-Universality of Words.

DLT 2019

  1. On Palindromic Length of Sturmian Sequences.
  2. First Lower Bounds for Palindromic Length.
  3. Computing the k-binomial Complexity of the Thue-Morse Word.
  4. On the Length of Shortest Strings Accepted by Two-Way Finite Automata.
  5. Separating Many Words by Counting Occurrences of Factors.
  6. The Relative Edit-Distance Between Two Input-Driven Languages.
  7. k-Spectra of Weakly-c-Balanced Words.

DLT 2018

  1. The Runs Theorem and Beyond.
  2. Block Sorting-Based Transformations on Words: Beyond the Magic BWT.

DLT 2017

  1. On the Number of Rich Words.

DLT 2016

  1. Ternary Square-Free Partial Words with Many Wildcards.

DLT 2015

  1. Unary Patterns with Permutations.
  2. Diverse Palindromic Factorization Is NP-complete.
  3. Grammar-Based Tree Compression.
  4. Squareable Words.
  5. State Complexity of Neighbourhoods and Approximate Pattern Matching.
  6. Transfinite Lyndon Words.
This site is open source. Improve this page.