%0 Journal Article %1 keyhere %A Czyzowicz, Jurek %A Fraczak, Wojciech %A Pelc, Andrzej %A Rytter, Wojciech %D 2003 %J Implementation and Application of Automata %K codes decomposition languages prime regular %P 225--237 %T Prime Decompositions of Regular Prefix Codes %U http://dx.doi.org/10.1007/3-540-44977-9_8 %X 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

@article{keyhere, 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}, added-at = {2008-12-01T04:13:19.000+0100}, author = {Czyzowicz, Jurek and Fraczak, Wojciech and Pelc, Andrzej and Rytter, Wojciech}, biburl = {https://www.bibsonomy.org/bibtex/20b8aa1e2027d35f2e910448b11a9f796/krystian}, description = {SpringerLink - Book Chapter}, interhash = {33dca429a1b01bf8ebfb61d473ca4193}, intrahash = {0b8aa1e2027d35f2e910448b11a9f796}, journal = {Implementation and Application of Automata}, keywords = {codes decomposition languages prime regular}, pages = {225--237}, timestamp = {2009-01-26T18:53:31.000+0100}, title = {Prime Decompositions of Regular Prefix Codes}, url = {http://dx.doi.org/10.1007/3-540-44977-9_8}, year = 2003 }