Universally Wheeler languages

DOI10.1007/978-3-032-01475-7_4MaRDI QIDQ6861885zbMATH OpenFDO

Authors Ruben Becker, G. Castiglione, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza, Antonio Restivo, Brian Riccardi

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01475-7_4

zbMATH Keywords

co-lexicographical sortingdeterministic finite automatagraph indexingstring matchingWheeler languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A new algorithm for optimal 2-constraint satisfaction and its implications
• Characterizations of locally testable events
• Co-lexicographically ordering automata and regular languages. I
• Families of locally testable languages
• Fully functional suffix trees and optimal text searching in BWT-runs bounded space
• Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Indexing compressed text
• On the complexity of k-SAT
• Optimal Wheeler language recognition
• Ordering regular languages and automata: complexity
• Syntactic complexity of regular ideals
• Wheeler graphs: a framework for BWT-based data structures
• Wheeler languages

Cited in

(1)

• Generalized Wheeler automata: minimality

This page was built for publication: Universally Wheeler languages

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