:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Oliveira, Mateus de Oliveira, Urmian, Sam
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms Artificial Intelligence Discrete Mathematics Formal Languages and Automata Theory Logic in Computer Science
Online Access:	https://arxiv.org/abs/2205.10995
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
by: Cotumaccio, Nicola
Published: (2023)

Symbolic Functional Decomposition: A Reconfiguration Approach
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)

Proving Properties of $φ$-Representations with the Walnut Theorem-Prover
by: Shallit, Jeffrey
Published: (2023)

Constant-delay enumeration for SLP-compressed documents
by: Muñoz, Martín, et al.
Published: (2022)

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
by: Cadilhac, Michaël, et al.
Published: (2025)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
by: Carette, Titouan, et al.
Published: (2025)

The commutativity problem for effective varieties of formal series, and applications
by: Clemente, Lorenzo
Published: (2025)

Beatty Sequences for a Quadratic Irrational: Decidability and Applications
by: Schaeffer, Luke, et al.
Published: (2024)

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
by: Muñoz, Martín
Published: (2026)

State Canonization and Early Pruning in Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)

CMSO-transducing tree-like graph decompositions
by: Campbell, Rutger, et al.
Published: (2024)

Weighted basic parallel processes and combinatorial enumeration
by: Clemente, Lorenzo
Published: (2024)

A Myhill-Nerode Type Characterization of 2detLIN Languages
by: Nagy, Benedek
Published: (2025)

Specifying and Verifying the Convergence Stairs of the Collatz Program
by: Ebnenasir, Ali
Published: (2024)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
by: Taylor, Landon, et al.
Published: (2025)

Generalized Hofstadter functions $G, H$ and beyond: numeration systems and discrepancy
by: Letouzey, Pierre
Published: (2025)

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

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

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

Subsequences in Bounded Ranges: Matching and Analysis Problems
by: Kosche, Maria, et al.
Published: (2022)

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

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

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

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
by: Inenaga, Shunsuke, et al.
Published: (2024)

Absent Subsequences in Words
by: Kosche, Maria, et al.
Published: (2021)

Exponent-Strings and Their Edit Distance
by: Baek, Ingyu
Published: (2024)

Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2025)

$k$-Universality of Regular Languages Revisited
by: Adamson, Duncan, et al.
Published: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)

Algorithmical Aspects of Some Bio Inspired Operations
by: Dumitran, Marius
Published: (2025)

Dynamic Membership for Regular Tree Languages
by: Amarilli, Antoine, et al.
Published: (2025)

On Minimizers of Minimum Density
by: Shur, Arseny
Published: (2025)

Linear Time Subsequence and Supersequence Regex Matching
by: Amarilli, Antoine, et al.
Published: (2025)

Wheeler Bisimulations
by: Cotumaccio, Nicola
Published: (2026)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
by: Negri, Pietro, et al.
Published: (2026)