Results 31 to 40 of about 73,517 (203)
Combinatorics on Binary Words and Codimensions of Identities in Left Nilpotent Algebras [PDF]
Algebra i logika, 2019 Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with specified properties ...
M. Zaicev, Dušan D. Repovš
semanticscholar +1 more source
Theoretical Computer Science, 2011 Special issue of the journal Theoretical Computer Science dedicated to the Conference WORDS ...
CARPI, Arturo, De Felice C.
openaire +3 more sources
On the Entropy of a Two Step Random Fibonacci Substitution
Entropy, 2013 We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, a → baa and b → ab, with probability , and → ba, with probability 1 – p for 0 < p < 1, and where the random rule is
Johan Nilsson
doaj +1 more source
A characterization of horizontal visibility graphs and combinatorics on words [PDF]
, 2010 An Horizontal Visibility Graph (for short, HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time series, their degree distribution being a good discriminator between randomness and ...
Gutin, Gregory +2 more
core +2 more sources
Analysis of the multiplicity matching parameter in suffix trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj +1 more source
Multicollision attacks and generalized iterated hash functions
Journal of Mathematical Cryptology, 2010 We apply combinatorics on words to develop an approach to multicollisions in generalized iterated hash functions. Our work is based on the discoveries of A. Joux and on generalizations provided by M. Nandi and D. Stinson as well as J. Hoch and A. Shamir.
Kortelainen Juha +2 more
doaj +1 more source
Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Jernej Azarija +3 more
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
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
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