Abstract
One of the new approaches to data classification uses finite state automata for representation of prefix codes. An important
task driven by the need for the efficient storage of such automata in memory is the decomposition of prefix codes into primefactors. We investigate properties of such prefix code decompositions. A linear time algorithm is designed which finds theprime decomposition F
Users
Please
log in to take part in the discussion (add own reviews or comments).