Weak factor automata: the failure of failure factor oracles?
In indexing of, and pattern matching on, DNA and text sequences, it is often important to represent all factors of a sequence. One efficient, compact representation is the factor oracle (FO). At the same time, any classical deterministic finite automata (DFA) can be transformed to a so-called failur...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
South African Institute of Computer Scientists and Information Technologists
2014-08-01
|
| Series: | South African Computer Journal |
| Subjects: | |
| Online Access: | http://sacj.cs.uct.ac.za/index.php/sacj/article/view/199 |