Participants
Contributed talks
- V. A. Baransky, T. A. Senchonok (Ural State Univ., Ekaterinburg)
Chromatic uniqueness of elements of height 3 in lattices of complete multipartite graphs.
- Mikhail V. Berlinkov (Ural State Univ., Ekaterinburg)
Some Methods Related to the Cerny Conjecture.
- M. Bucci, A. De Luca, L. Q. Zamboni (Univ. of Turku)
Reversible Christoffel factorizations.
- Dmitry V. Chistikov (Moscow State Univ.)
Using Relevance Queries for Identification of Read-Once Functions.
- Anna Frid (Sobolev Institute, Novosibirsk)
To be announced.
- Tomas Hejda, Zuzana Masakova, Edita Pelantova (Czech Technical Univ., Prague)
Dynamical systems generating the extremal representations in a negative base.
- Edward A. Hirsch, Dmitry Itsykson (Steklov Institute, St. Petersburg)
On an optimal randomized acceptor for graph nonisomorphism.
- Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolaenko, Alexander Smal
(Steklov Institute, St. Petersburg)
Optimal heuristic algorithms for the image of an injective function.
- Mika Hirvensalo (Univ. of Turku)
A Method for Computing the Characteristic Polynomial and Determining Semidefiniteness.
- Sandrine Julia (Univ. of Nice, Sophia Antipos)
Minimal uncompletable words.
- Juhani Karhumaki, Aleksi Saarela (Univ. of Turku)
On Maximal Chains of Systems of Word Equations.
- D. V. Karpov (Steklov Institute, St. Petersburg)
Dynamic proper vertex colorings of a graph.
- Alica Kelemenova (Silesian Univ., Opava)
Complementary Reset Words Problem.
- Dexter Kozen (Cornell Univ.), Alexandra Silva (Radboud University, Nijmegen)
On Moessner’s Theorem.
- P. V. Martyugin (Ural State Univ., Ekaterinburg)
Synchronization of automata with one undefined or ambiguous transition.
- Reza Naserasr (Labri, Bordeaux)
Mapping planar graphs into projective cubes: an extension of the four-colour theorem.
- S. Nikolenko (Steklov Institute, St. Petersburg)
A group-based combinatorial complete one-way function.
- S. A. Obraztsova, A. V. Pastor (Steklov Institute, St. Petersburg)
About vertices of degree k of minimally and contraction critically k-connected
graphs: upper bounds
- Alexander Okhotin (Univ. of Turku)
Formal grammars: reappraising the foundations.
- Svetlana Puzynina (Univ. of Turku)
On some new abelian properties of infinite words.
- Aleksi Saarela (Univ. of Turku)
Word Equations and Linear Algebra.
Student talks
- D. S. Ananichev, D. D. Dublennykh (Ural State Univ., Ekaterinburg)
Lower bounds for the number of keys in Zakrevskij cipher.
- A. V. Bankevich (Steklov Institute, St. Petersburg)
Bounds of a number of leafs of spanning trees in graphs without triangles.
- Ivan Burmistrov, Lesha Khvorost (Ural State Univ., Ekaterinburg)
Straight-line Programs: A Practical Test.
- A. L. Glazman (Steklov Institute, St. Petersburg)
Generalized flowers in k-connected graphs. Application to the case k = 4.
- Mari Huova, Juhani Karhumaki (Univ. of Turku)
Observations and Problems on k-abelian avoidability.
- Dmitry Itsykson, Dmitry Sokolov (Steklov Institute, St. Petersburg)
Lower bounds for myopic DPLL algorithms with a cut heuristic.
- Marina I. Maslennikova (Ural State Univ., Ekaterinburg)
Reset complexity of regular languages.
- G. V. Nenashev (Steklov Institute, St. Petersburg)
An upper bound on the chromatic number of circle graphs without K4.
- Elena A. Petrova, Arseny M. Shur (Ural State Univ., Ekaterinburg)
Constructing Premaximal Binary Cube-free Words of Any Level.
- Turo Sallinen (Univ. of Turku)
Function and Image Manipulation with Automata.
- Alexey V. Samsonov, Arseny M. Shur (Ural State Univ., Ekaterinburg)
On Abelian Repetition Threshold.
- Evgeny Skvortsov, Yulia Zaks (Ural State Univ., Ekaterinburg)
Synchronizing random automata on 3-letter alphabet.
