Cover Image

Unclustered BWTs of any Length over Non-Binary Alphabets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fici, Gabriele, Gabory, Estéban, Romana, Giuseppe, Sciortino, Marinella
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Data Structures and Algorithms Formal Languages and Automata Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Morphisms and BWT-run Sensitivity
by: Fici, Gabriele, et al.
Published: (2025)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)

Some Remarks on Palindromic Periodicities
by: Fici, Gabriele, et al.
Published: (2024)

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform
by: Ingels, Florian, et al.
Published: (2025)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
by: Fujimaru, Hiroto, et al.
Published: (2025)

Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
by: Burcsi, Péter, et al.
Published: (2020)

Digital Convexity and Combinatorics on Words
by: De Luca, Alessandro, et al.
Published: (2025)

Repetition Threshold for Binary Automatic Sequences
by: Allouche, J. -P., et al.
Published: (2024)

Exploring Repetitiveness Measures for Two-Dimensional Strings
by: Romana, Giuseppe, et al.
Published: (2024)

Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)

From Width-Based Model Checking to Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2022)

The Repetition Threshold for Rote Sequences
by: Ollinger, Nicolas, et al.
Published: (2024)

String Attractors for Automatic Sequences
by: Schaeffer, Luke, et al.
Published: (2020)

Some Fibonacci-Related Sequences
by: Cloitre, Benoit, et al.
Published: (2023)

Runs in Paperfolding Sequences
by: Shallit, Jeffrey
Published: (2024)

Self-Verifying Predicates in Büchi Arithmetic
by: Khodier, Mazen, et al.
Published: (2025)

Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)

Dyck Words, Pattern Avoidance, and Automatic Sequences
by: Mol, Lucas, et al.
Published: (2023)

Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)

Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
by: Carton, Olivier, et al.
Published: (2024)

On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)

The Smallest String Attractors of Fibonacci and Period-Doubling Words
by: Banbara, Mutsunori, et al.
Published: (2026)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
by: Rigo, Michel, et al.
Published: (2024)

Banach density of generated languages: Dichotomies in topology and dimension
by: Kleinberg, Jon, et al.
Published: (2026)

Ten Squares Force an Overlap
by: Shallit, Jeffrey
Published: (2026)

Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)

A Language-Theoretic Approach to the Heapability of Signed Permutations
by: Istrate, Gabriel
Published: (2024)

Strongly k-recursive sequences
by: Krenn, Daniel, et al.
Published: (2024)

Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
by: Moradi, Delaram, et al.
Published: (2026)

(Sets of ) Complement Scattered Factors
by: Adamson, Duncan, et al.
Published: (2026)

Checking and producing word attractors
by: Béal, Marie-Pierre, et al.
Published: (2025)

The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)

Bit catastrophes for the Burrows-Wheeler Transform
by: Giuliani, Sara, et al.
Published: (2024)

Dynamic direct access of MSO query evaluation over strings
by: Bourhis, Pierre, et al.
Published: (2024)

A closer look at TDFA
by: Borsotti, Angelo, et al.
Published: (2022)

A Fast Algorithm for Computing Prefix Probabilities
by: Nowak, Franz, et al.
Published: (2023)