"úÁÐÉÓËÉ ÎÁÕÞÎÙÈ ÓÅÍÉÎÁÒÏ× ðïíé"

• ðÒÅÄÉÓÌÏ×ÉÅ .......5 (.pdf)
• áÎÁÎÉÞÅ× ä. ó., ÷ÏÌËÏ× í. ÷., çÕÓÅ× ÷. ÷. ðÒÉÍÉÔÉ×ÎÙÅ ÏÒÇÒÁÆÙ Ó ÂÏÌØÛÉÍÉ ÜËÓÐÏÎÅÎÔÁÍÉ É ÍÅÄÌÅÎÎÏ ÓÉÎÈÒÏÎÉÚÉÒÕÅÍÙÅ Á×ÔÏÍÁÔÙ.......9 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• áÎÁÎÉÞÅ× ä. ó., äÕÂÌÅÎÎÙÈ ä. ä. îÉÖÎÉÅ ÏÃÅÎËÉ ËÏÌÉÞÅÓÔ×Á ËÌÀÞÅÊ ÛÉÆÒÁ úÁËÒÅ×ÓËÏÇÏ.......40 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• âÕÒÍÉÓÔÒÏ× é. ó., ëÏÚÌÏ×Á á. ÷., ëÕÒÐÉÌÑÎÓËÉÊ å. â., è×ÏÒÏÓÔ á. á. üÆÆÅËÔÉ×ÎÏÅ ÓÖÁÔÉÅ ÄÁÎÎÙÈ Ó ÐÏÍÏÝØÀ ÐÒÑÍÏÌÉÎÅÊÎÙÈ ÐÒÏÇÒÁÍÍ.......45 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• äÁ×ÙÄÏ× á. ð. ïÃÅÎËÉ ÓÌÏÖÎÏÓÔÉ ÁÌÇÏÒÉÔÍÁ çÒÉÇÏÒØÅ×Á ÄÌÑ ÒÅÛÅÎÉÑ ÔÒÏÐÉÞÅÓËÉÈ ÌÉÎÅÊÎÙÈ ÓÉÓÔÅÍ.......69 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• úÁËÓ à. é., óË×ÏÒÃÏ× å. ó. óÉÎÈÒÏÎÉÚÉÒÕÅÍÙÅ ÓÌÕÞÁÊÎÙÅ Á×ÔÏÍÁÔÙ ÎÁÄ 4-ÂÕË×ÅÎÎÙÍ ÁÌÆÁ×ÉÔÏÍ.......83 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• îÉËÏÌÅÎËÏ ó. é., ôÕÇÁÒ£× ä. ó. ðÏÌÎÁÑ ÏÄÎÏÓÔÏÒÏÎÎÑÑ ÆÕÎËÃÉÑ, ÏÓÎÏ×ÁÎÎÁÑ ÎÁ Ó×ÏÂÏÄÎÏÍ $({\mathbb Z} \times {\mathbb Z})$-ÍÏÄÕÌÅ ËÏÎÅÞÎÏÇÏ ÒÁÎÇÁ.......91 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ðÏÎÏÍÁÒÅÎËÏ é. î. âÁÚÙ ÛÕÒÏ×ÙÈ ÁÎÔÉÓÉÍÍÅÔÒÉÞÅÓËÉÈ ËÏÇÅÒÅÎÔÎÙÈ ËÏÎÆÉÇÕÒÁÃÉÊ É ÐÒÏ×ÅÒËÁ ÉÚÏÍÏÒÆÉÚÍÁ ÛÕÒÏ×ÙÈ ÔÕÒÎÉÒÏ×.......108 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• óÁÌÌÉÎÅÎ ô. ðÒÅÏÂÒÁÚÏ×ÁÎÉÑ ÆÕÎËÃÉÊ Ó ÐÏÍÏÝØÀ Á×ÔÏÍÁÔÏ×.......148 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• èÕÏ×Á í., ëÁÒÈÀÍÑËÉ à. ï $k$-ÁÂÅÌÅ×ÏÊ ÉÚÂÅÇÁÅÍÏÓÔÉ.......170 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• þÉÓÔÉËÏ× ä. ÷. éÓÐÏÌØÚÏ×ÁÎÉÅ ÚÁÐÒÏÓÏ× ÓÕÝÅÓÔ×ÅÎÎÏÓÔÉ ÄÌÑ ÒÁÓÛÉÆÒÏ×ËÉ ÂÅÓÐÏ×ÔÏÒÎÙÈ ÆÕÎËÃÉÊ.......183 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• òÅÆÅÒÁÔÙ ....... 218 (.pdf)

---


Contents 
• Preface .......5
• Ananichev D. S., Volkov M. V., Gusev V. V. Primitive digraphs with large exponents and slowly synchronizing automata.......9
• Ananichev D. S., Dublennykh D. D. Lower bounds for the number of keys in Zakrevskij cipher.......40
• Burmistrov I. S., Kozlova A. V., Kurpilyansky E. B., Khvo\-rost A. A. Efficient data compression by straight-line programs.......45
• Davydow A. P. Upper and lower bounds for Grigor'iev's algorithm for solving integral tropical linear systems.......69
• Zaks Yu. I., Skvortsov E. S. Synchronizing random automata on 3-letter alphabet.......83
• Nikolenko S. I., Tugaryov D. S. A Complete one-way function based on a free finite rank ${\mathbb Z}\times{\mathbb Z}$-module.......91
• Ponomarenko I. N. Bases of schurian antisymmetric coherent configurations and isomorphism test for schurian tournaments.......108
• Sallinen T. Function transformations with automata.......148
• Huova M., Karhum\"aki J. On $k$-abelian avoidability.......170
• Chistikov D. V. Using relevance queries for identification of read-once functions........183
• Reviews ....... 218

---

Paging: 221 pp.

• ---

  Back to the Petersburg Department of Steklov Institute of Mathematics