... A. I. Shirshov proved that the set of non -divisible words over alphab et of cardinality l has b ounded height h over the set Y consisting of all the words of degree We show, that n - 1. 12 log3 n+36 log3 log3 n+91 h < (n, l), where (n, l) = 296 l · n Let ...
[
Текст
]
Ссылки http://www.mccme.ru/dfc/2013/Program1/Kharitonov_Summary.pdf -- 95.4 Кб -- 04.10.2013 Похожие документы
... СОДЕРЖАНИЕ . Предисловие (MS WORD) . ... для старшей ступени общеоб-разовательной школы с профильным обучением (MS WORD ... Русский язык (MS WORD) . Литература (MS WORD) . Иностранный язык (MS WORD) . ...
... Background from group and graph theories. Word problem. Cayley graphs. ... Word problem. Cayley graphs. The word problem and Cayley graphs. ... Dehn's solution to the word problem for the hyperbolic surface groups. ...
... Combinatorics on words. Growth rate and extremal letter frequencies of words avoiding some repetitions. See here .. ... Combinatorics on words. Growth rate and extremal letter frequencies of words avoiding some repetitions. See here .. ...
... The paramount principle is that the UN's word must be taken seriously, and if we have to subvert its word to guarantee that it is, then by gum, we will. ...
... Let G = S be a group generated by the set S. For any x G, define its word length x to be the length of the shortest word in the alphabet S S-1 that represents the element x: x S S = min{n | ...
... N 13?51?145/13 (1?9 класс) MS-WORD file , PDF file . и N 13?51?144/13 (10?11 класс) MS-WORD file , PDF file . ... N 13?51?145/13 (1?9 класс) MS-WORD file , PDF file . и N 13?51?144/13 (10?11 класс) MS-WORD file , PDF file . ...
... Tel 04 91 28 89 25 Email nicolas.bedaride@univ-cezanne.fr Web page http://junon.u-3mrs.fr/bedaride Research areas Key words ... Polygonal billiard, outer billiard, piecewise isometries. Combinatorics on words, complexity function. Theory of Tilings. ...