Results 41 to 50 of about 73,517 (203)
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
Transition Property For Cube-Free Words [PDF]
, 2018 We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair $(u,v)$ of $d$-ary cube-free words, if $u$ can be infinitely extended to the right and $v$ can be infinitely extended to the ...
A Carpi +20 more
core +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
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
Doubled patterns are $3$-avoidable [PDF]
, 2015 In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern $p$ is said to
Ochem, Pascal
core +2 more sources
Music and combinatorics on words: a historical survey
Journal of Mathematics and Music - Mathematical and Computational Approaches to Music Theory, Analysis, Composition and Performance, 2018 In the preface of Lothaire’s book Combinatorics On Words first published in 1983, Dominique Perrin wrote: “It can be roughly said that automata theory (and formal language theory) deals with sets of words whereas combinatorics on words considers ...
S. Brlek, M. Chemillier, C. Reutenauer
semanticscholar +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
Pairwise Well-Formed Modes and Transformations
, 2017 One of the most significant attitudinal shifts in the history of music occurred in the Renaissance, when an emerging triadic consciousness moved musicians towards a new scalar formation that placed major thirds on a par with perfect fifths. In this paper
D Clampitt +7 more
core +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
Goč, Daniel +2 more
openaire +1 more source