| Нет данных |
| RAIRO - Theoretical Informatics and Applications |
— |
POLYNOMIAL LANGUAGES WITH FINITE ANTIDICTIONARIES / Shur A.M. // RAIRO - Theoretical Informatics and Applications. - 2009. - V. 43, l. 2. - P. 269-279. |
2009 |
2 |
| Lecture Notes in Computer Science |
— |
TWO-SIDED BOUNDS FOR THE GROWTH RATES OF POWER-FREE LANGUAGES / Shur A.M. // Lecture Notes in Computer Science. - 2009. - V. 5583 LNCS, l. . - P. 466-477. |
2009 |
11 |
| Известия высших учебных заведений. Математика |
— |
ИНДЕКСЫ РОСТА ЯЗЫКОВ ОГРАНИЧЕННОЙ ЭКСПОНЕНТЫ / Шyp A.M. // Известия высших учебных заведений. Математика. - 2009. - V. , l. 9. - P. 82-88. |
2009 |
2 |
| Lecture Notes in Computer Science |
— |
COMBINATORIAL COMPLEXITY OF REGULAR LANGUAGES / Shur A.M. // Lecture Notes in Computer Science. - 2008. - V. 5010 LNCS, l. . - P. 289-301. |
2008 |
16 |
| RAIRO - Theoretical Informatics and Applications |
— |
COMPARING COMPLEXITY FUNCTIONS OF A LANGUAGE AND ITS EXTENDABLE PART / Shur A.M. // RAIRO - Theoretical Informatics and Applications. - 2008. - V. 42, l. 3. - P. 647-655. |
2008 |
11 |
| International Journal of Foundations of Computer Science |
— |
RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES / Shur A.M. // International Journal of Foundations of Computer Science. - 2007. - V. 18, l. 3. - P. 655-665. |
2007 |
2 |
| — |
— |
ЯЗЫКИ, ГРАММАТИКИ, РАСПОЗНАВАТЕЛИ / А. П. Замятин, А. М. Шур // . - 2007. - V. , l. . |
2007 |
5 |
| Lecture Notes in Computer Science |
— |
FACTORIAL LANGUAGES OF LOW COMBINATORIAL COMPLEXITY / Shur A.M. // Lecture Notes in Computer Science. - 2006. - V. 4036 LNCS, l. . - P. 397-407. |
2006 |
2 |
| Izvestiya: Mathematics |
— |
PARTIAL WORDS AND THE INTERACTION PROPERTY OF PERIODS / Shur A.M.,Gamzova Yu.V. // Izvestiya: Mathematics. - 2004. - V. 68, l. 2. - P. 405-428. |
2004 |
1 |
| — |
— |
КОМБИНАТОРИКА СЛОВ / Шур А.М. // . - 2003. - V. , l. . |
2003 |
4 |