Random Wheeler automata

DOI10.4230/LIPICS.CPM.2024.5MaRDI QIDQ6891096zbMATH OpenFDO

Authors Ruben Becker, Davide Cenzato, SungHwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2024.5

zbMATH Keywords

Burrows-Wheeler transformrandom graphsWheeler automata

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• On representing the degree sequences of sublogarithmic-degree Wheeler graphs
• On the complexity of recognizing Wheeler graphs
• Ordering regular languages and automata: complexity
• Prefix-free parsing for building large tunnelled Wheeler graphs
• Random deterministic automata
• Regular Languages meet Prefix Sorting
• Space efficient merging of de Bruijn graphs and Wheeler graphs
• Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
• Wheeler graphs: a framework for BWT-based data structures
• Wheeler languages

This page was built for publication: Random Wheeler automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891096)