Results 41 to 50 of about 2,178 (219)
Occurrences of palindromes in characteristic Sturmian words [PDF]
, 2006 This paper is concerned with palindromes occurring in characteristic Sturmian words cα of slope α, where α∈(0,1) is an irrational. As cα is a uniformly recurrent infinite word, any (palindromic) factor of cα occurs infinitely many times in cα with ...
Glen, Amy, Glen, Amy Louise, Glen, A.
core +2 more sources
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 +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
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
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
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
A characterization of fine words over a finite alphabet [PDF]
, 2006 To any infinite word t over a finite alphabet A we can associate two infinite words min (t) and max (t) such that any prefix of min (t) (resp. max (t)) is the lexicographically smallest (resp. greatest) amongst the factors of t of the same length. We say
Glen, Amy, Glen, A.
core +2 more sources
Finite-Repetition threshold for infinite ternary words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a ...
Golnaz Badkobeh, Maxime Crochemore
doaj +1 more source
On the Contribution of WORDS to the Field of Combinatorics on Words [PDF]
, 2015 We propose some notes about the history and the features of the conference WORDS, our goal being to testify how the conference may be embedded in the development of the field of Combinatorics on Words.
openaire +2 more sources