Linear-time prime decomposition of regular prefix codes

Document Type

Conference Proceeding

Publication Date

12-1-2003

Abstract

One of the new approaches to data classification uses prefix codes and finite state automata as representations of prefix codes. A prefix code is a (possibly infinite) set of strings such that no string is a prefix of another one. An important task driven by the need for the efficient storage of such automata in memory is the decomposition (in the sense of formal languages concatenation) of prefix codes into prime factors. We investigate properties of such prefix code decompositions. A prime decomposition is a decomposition of a prefix code into a concatenation of nontrivial prime prefix codes. A prefix code is prime if it cannot be decomposed into at least two nontrivial prefix codes. In the paper a linear time algorithm is designed which finds the prime decomposition F1F2...Fk of a regular prefix code F given by its minimal deterministic automaton. Our results are especially interesting for infinite regular prefix codes. © 2003 World Scientific Publishing Company.

Identifier

33645403302 (Scopus)

Publication Title

International Journal of Foundations of Computer Science

External Full Text Location

https://doi.org/10.1142/S0129054103002151

ISSN

01290541

First Page

1019

Last Page

1031

Issue

6

Volume

14

This document is currently not available here.

Share

COinS