Now showing items 1-2 of 2
Weak factor automata : the failure of failure factor oracles?
(South African Institute of Computer Scientists and Information Technologists, 2014-08)
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 ...
A taxonomy of minimisation algorithms for deterministic tree automata
(J.UCS Consortium, 2016)
We present a taxonomy of algorithms for minimising deterministic bottomup tree automata (dtas) over ranked and ordered trees. Automata of this type and its extensions are used in many application areas, including natural ...