Results 131 to 140 of about 1,541,664 (157)
Eulerian entropy and non-repetitive subword complexity [PDF]
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moothathu, T.K. Subrahmonian +1 more
exaly +4 more sources
On the joint subword complexity of automatic sequences
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yossi Moshe
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An improvement of subword complexity
Random Operators and Stochastic Equations, 2011Abstract In this article we propose a simple method to estimate the complexity of a finite word written over a finite alphabet. We use the notion of subword complexity (which is equal to the number of different subwords in the word) as a starting point and show the computation difficulties connected with the usage of subword ...
Evgeny Ivanko
exaly +2 more sources
On the subword complexity of Thue–Morse polynomial extractions
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yossi Moshe
exaly +2 more sources
Asymptotic subword complexity of fixed points of group substitutions [PDF]
Theoretical Computer Science, 2009 The subword complexity of fixed points of some types of substitutions was studied by various authors. Here we introduce a family of substitutions, arising from multiplication tables of finite groups and other similar structures, and analyze their subword
Goldstein, Ilya
exaly +2 more sources
On the subword complexity of square-free DOL languages [PDF]
Theoretical Computer Science, 1981 The subword complexity of a language K is the function which to every positive integer n assigns the number of different subwords of length n occuring in words of K.
A Ehrenfeucht
exaly +2 more sources
Super-stationary set, subword problem and the complexity
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Tan, Hui Rao, Yu-Mei Xue
exaly +3 more sources
Relationally Periodic Sequences and Subword Complexity
Lecture Notes in Computer Science, 2008By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of length nis constant. In this paper we consider relational periods and relationally periodic sequences, where the relation is a similarity relation on words induced by a ...
Tomi Karki +2 more
exaly +3 more sources
Subword complexity of uniform D0L words over finite groups [PDF]
Theoretical Computer Science, 2011 We deal with the subword complexity of uniform D0L words obtained from group substitutions. Our main interest is whether the subword complexity is “almost proportional” to the length of the factor.
Ilya Goldstein, Goldstein, Ilya
exaly +2 more sources
On the subword complexity of locally catenative dol languages
Information Processing Letters, 1983Abstract The subword complexity of language K, denoted Gv; K , is the function of positive integers such that Gv; K (n) equals the number of subwords of length n that occur in (words of) K. It is proved that if K is a locally catenative DOL language, then Gv; K is bounded by a linear function.
A Ehrenfeucht
exaly +3 more sources