A Myhill-Nerode theorem is proven for generalized automata via W(A), enabling Wheeler automata storage in e log sigma (1+o(1)) + O(e) bits with O(m log log sigma) pattern matching time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
A Myhill-Nerode theorem is proven for generalized automata via W(A), enabling Wheeler automata storage in e log sigma (1+o(1)) + O(e) bits with O(m log log sigma) pattern matching time.