Q6147410

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Generalized Wheeler automata: minimality	2026-09-23	Paper
Fast pattern matching with epsilon transitions Acta Informatica	2026-09-14	Paper
Encoding co-lex orders of finite-state automata in linear space	2026-07-17	Paper
Improved circular dictionary matching	2026-07-17	Paper
Sorting circular suffixes in linear time	2026-02-10	Paper
Fast pattern matching with epsilon transitions	2026-01-13	Paper
Computing the LCP array of a labeled graph	2025-12-02	Paper
A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression	2025-11-10	Paper
Prefix sorting DFAs: a recursive algorithm	2025-07-24	Paper
Data compression meets automata theory Bulletin of the European Association for Theoretical Computer Science EATCS	2025-04-22	Paper
Co-lexicographically ordering automata and regular languages. I Journal of the ACM	2025-02-05	Paper
Space-time trade-offs for the LCP array of Wheeler DFAs	2024-05-29	Paper
scientific article; zbMATH DE number 7788491 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper

Research outcomes over time

This page was built for person: