Introduction to algorithms
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On the Decomposition of Finite Languages
On the Decomposition of Finite Languages
Prime normal form and equivalence of simple grammars
Theoretical Computer Science - Implementation and application of automata
Concatenation state machines and simple functions
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The generalization of generalized automata: expression automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Prime normal form and equivalence of simple grammars
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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 prime factors. We investigate properties of such prefix code decompositions. 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.