Results 41 to 50 of about 70,377,857 (147)
On Correlation Polynomials and Subword Complexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$.
Irina Gheorghiciuc, Mark Daniel Ward
doaj +1 more source
Well quasi-order in combinatorics : embeddings and homomorphisms [PDF]
, 2015 The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame ...
Ruskuc, Nik +5 more
core +1 more source
Protected node profile of Tries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some practical motivations, e.g., in organizational schemes, security models and social-network models.
Mehri Javanian
doaj +1 more source
On the Entropy and Letter Frequencies of Powerfree Words
Entropy, 2008 We review the recent progress in the investigation of powerfree words, with particular emphasis on binary cubefree and ternary squarefree words. Besides various bounds on the entropy, we provide bounds on letter frequencies and consider their empirical ...
Manuela Heuer, Uwe Grimm
doaj +1 more source
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS [PDF]
International Journal of Foundations of Computer Science, 2012 We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using finite automata and a software package for manipulating them. We illustrate our technique by applying it to (a) solve an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence; (b) verify an old result of
Daniel Goc +2 more
openaire +3 more sources
Frontiers in Human Neuroscience, 2018 We hypothesize a beneficial influence of sleep on the consolidation of the combinatorial mechanisms underlying incremental sentence comprehension.
Zachariah R. Cross +5 more
doaj +1 more source
Information theory: Sources, Dirichlet series, and realistic analyses of data structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Most of the text algorithms build data structures on words, mainly trees, as digital trees (tries) or binary search trees (bst). The mechanism which produces symbols of the words (one symbol at each unit time) is called a source, in information theory ...
Mathieu Roux, Brigitte Vallée
doaj +1 more source
Journal of High Energy Physics, 2018 Permutations and associated algebras allow the construction of half and quarter BPS operators in maximally supersymmetric Yang Mills theory with U(N), SO(N) and Sp(N) gauge groups.
Christopher Lewis-Brown +1 more
doaj +1 more source
Mini-Workshop: Combinatorics on Words [PDF]
, 2010 The area of combinatorics on words is concerned with properties of sequences of symbols. It is characteristic to the field that questions arise from various mathematical problems, and hence, many fundamental results on words have been established in ...
core +2 more sources
Constructing Words with High Distinct Square Densities [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last, occurrence begin at each position.
F. Blanchet-Sadri, S. Osborne
doaj +1 more source