Results 51 to 60 of about 73,359 (215)
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]
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
Finite-Repetition threshold for infinite ternary words [PDF]
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
Bacteria classification using minimal absent words
Bacteria classification has been deeply investigated with different tools for many purposes,such as early diagnosis, metagenomics, phylogenetics. Classification methods based on ribosomalDNA sequences are considered a reference in this area. We present a
Gabriele Fici +3 more
doaj +1 more source
Ten Conferences WORDS: Open Problems and Conjectures
In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS.
Néraud, Jean
core +3 more sources
The Identity Correspondence Problem and its Applications [PDF]
In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an identity pair by a ...
C. Choffrut +13 more
core +4 more sources
Some combinatorics of rhomboid-shaped fully packed loop configurations [PDF]
The study of rhomboid-shaped fully packed loop configurations (RFPLs) is inspired by the work of Fischer and Nadeau on triangular fully packed loop configurations (TFPLs).
Sabine Beil
doaj +1 more source
String attractors and combinatorics on words [PDF]
The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors.
Mantaci S. +4 more
core
Two strings at Hamming distance 1 cannot be both quasiperiodic
We present a generalization of a known fact from combinatorics on words related to periodicity into quasiperiodicity. A string is called periodic if it has a period which is at most half of its length. A string $w$ is called quasiperiodic if it has a non-
Amir, Amihood +2 more
core +1 more source
The Role of Dice in the Emergence of the Probability Calculus
Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source

