Geodesic
On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 92-94 
I. R. Akishev; M. E. Dvorkin. On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 92-94. http://geodesic.mathdoc.fr/item/PDM_2010_12_a46/
@article{PDM_2010_12_a46,
     author = {I. R. Akishev and M. E. Dvorkin},
     title = {On constructing minimal deterministic finite automaton recognizing a~prefix-code of given cardinality},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {92--94},
     year = {2010},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a46/}
}
TY  - JOUR
AU  - I. R. Akishev
AU  - M. E. Dvorkin
TI  - On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 92
EP  - 94
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a46/
LA  - ru
ID  - PDM_2010_12_a46
ER  - 
%0 Journal Article
%A I. R. Akishev
%A M. E. Dvorkin
%T On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 92-94
%N 12
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a46/
%G ru
%F PDM_2010_12_a46

Voir la notice de l'article provenant de la source Math-Net.Ru

The article considers the problem of constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality over the alphabet $\{0,1\}$. The considered problem is proved to be equivalent to the problem of finding the shortest addition-chain ending with a given number. Several interesting properties of the desired minimal finite automaton are proved, and the identical problem concerning Moore automata is discussed.

[1] Golin M. J., Na H., “Optimal prefix-free codes that end in a specified pattern and similar problems: The uniform probability case (extended abstract)”, Data Compression Conference, 2001, 143–152

[2] Han Y.-S., Salomaa K., Wood D., “State complexity of prefix-free regular languages”, Proc. of the 8th Int. Workshop on Descriptional Complexity of Formal Systems, 2006, 165–176

[3] Knut D. E., Iskusstvo programmirovaniya, v. 2, Poluchislennye algoritmy, Vilyams, M., 2004, 832 pp.

[4] Bleichenbacher D., Efficiency and security of cryptosystems based on number theory, Zürich, 1996 | Zbl

[5] Cruz-Cortes N., Rodriguez-Henriquez F., Juarez-Morales R., Coello C. A., “Finding optimal addition chains using a genetic algorithm approach”, LNCS, 3801, 2005, 208–215

[6] Nedjah N., de Macedo M. L., “Finding minimal addition chains using ant colony”, IDEAL, LNCS, 3177, eds. R. Y. Zheng, R. M. Everson, Y. Hujun, 2004, 642–647

[7] Downey P., Leong B., Sethi R., “Computing sequences with addition chains”, SIAM J. Computing, 10:3 (1981), 638–646 | DOI | MR | Zbl