On Minimizing Cover Automata for Finite Languages in O(n log n) Time (2008)
A deterministic finite automaton (DFA) is called a cover automaton (DFCA) for a finite language L over some alphabet # if L = L(A) # #l , with l being the length of some longest word in L.
A Time And Space Efficient Algorithm For Minimizing Cover Automata For Finite Languages (2008)
A deterministic finite automaton (DFA) is called a cover automaton (DFCA) for a finite language L over some alphabet # if L = L(A) # #l , with l being the length of some longest word in L. Thus a...
An Efficient Indexing and Search Technique for Multimedia Databases (2003)
Michael Clausen, Heiko Körner, Frank Kurth
We present a novel index-based approach for searching multimedia databases by content. Our approach integrates methods from classical full-text retrieval with the mathematical concept of groups...