On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality
Download file
Counter downloads: 284
Keywords
Authors
| Name | Organization | |
| Akishev I.R. | St. Petersburg State University of Information Technologies, Mechanics and Optics | akishev@rain.ifmo.ru |
| Dvorkin M. E. | St. Petersburg State University of Information Technologies, Mechanics and Optics | dvorkin@rain.ifmo.ru |
References
Colin 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. P. 143-152.
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. P. 165-176.
Кнут Д. Э. Искусство программирования. Т. 2. Получисленные алгоритмы. М.: Вильямс, 2004. 832 с.
Bleichenbacher D. Efficiency and security of cryptosystems based on number theory. Zurich, 1996.
Cruz-Cortes N., Rodriguez-Henriquez F., Juarez-Morales R., Coello C. A. Finding optimal addition chains using a genetic algorithm approach / / LNCS. 2005. V. 3801. P. 208-215.
Nedjah N., de Macedo M. L. Finding minimal addition chains using ant colony / / IDEAL / ed. by R. Y. Zheng, R. M. Everson, Y. Hujun. LNCS. 2004. V. 3177. P. 642-647.
Downey P., Leong B., Sethi R. Computing sequences with addition chains / / SIAM J. Computing. 1981. V. 10. No.3. P. 638-646.
