RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


2010, Number 1  

The present issue is thematic and is devoted to relations between two topical trends of theoretical computer science — theory of finite automata and combinatorics of words. Compilers and scientific editors are the member of the Editorial board of the journal, professor L. N. Shevrin and professor M. V. Volkov.


News of mathematical life in Russia and the CIS
1
The annulation threshold for partially monotonic automata
D. S. Ananichev
3
A vector space approach to the road coloring problem
G. Budzban, Ph. Feinsilver
14
Weinbaum factorizations of primitive words
V. Diekert, T. Harju, D. Nowotka
21
Weighted automata and weighted logic on infinite words
M. Droste, G. Rahonis
34
A lower bound for the length of the shortest carefully synchronizing words
P. V. Martyugin
59
The mirror image of the language of 2-synchronizing words
I. V. Petrov
69
Almost periodicity, finite automata mappings, and related effectiveness issues
Yu. L. Pritykin
74
Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019