Completing Wheeler automata

DOI10.1016/J.TCS.2025.115631MaRDI QIDQ6884333zbMATH OpenFDO

Authors G. Castiglione, Antonio Restivo

Publication date 15 December 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115631

zbMATH Keywords

Boolean operationscomplete automataWheeler automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A remark on incompletely specified automata
• Co-lexicographically ordering automata and regular languages. I
• Each regular code is included in a maximal regular code
• Embeddings of local automata
• scientific article; zbMATH DE number 512840 (Why is no real title available?)
• scientific article; zbMATH DE number 7788491 (Why is no real title available?)
• On the complexity of recognizing Wheeler graphs
• Ordering regular languages and automata: complexity
• Space efficient merging of de Bruijn graphs and Wheeler graphs
• Surjective Extensions of Sliding-Block Codes
• Syntactic complexities of six classes of star-free languages
• Wheeler graphs: a framework for BWT-based data structures
• Wheeler languages

This page was built for publication: Completing Wheeler automata

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