Results 31 to 40 of about 67,579,596 (150)
Directive words of episturmian words: equivalences and normalization [PDF]
, 2008 Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms.
Amy Glen +8 more
core +1 more source
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Counting words with Laguerre polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials.
Jair Taylor
doaj +1 more source
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
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
Conjugates of characteristic Sturmian words generated by morphisms [PDF]
, 2004 This article is concerned with characteristic Sturmian words of slope α and 1-α (denoted by cα and c1-α resp.), where α∈(0,1) is an irrational number such that α=[0;1+d1,d2,..., dn] with dn≥d1≥1.
Glen, Amy +3 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
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
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 +3 more
core +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