Results 41 to 50 of about 3,800,669 (273)
Entailment Relations on Distributions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In this paper we give an overview of partial orders on the space of probability distributions that carry a notion of information content and serve as a generalisation of the Bayesian order given in (Coecke and Martin, 2011).
John van de Wetering
doaj +1 more source
Border Correlations of Partial Words [PDF]
Theory of Computing Systems, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francine Blanchet-Sadri +2 more
openaire +1 more source
Mathematics, 2023 We generalize the concept of a fuzzy metric by introducing its approximating counterpart in order to make it more appropriate for the study of some problems related to combinatorics on words.
Raivis Bēts, Alexander Šostak
doaj +1 more source
Partial words and a theorem of Fine and Wilf
Theoretical Computer Science, 1999 Jean Berstel
exaly +2 more sources
Constructing partial words with subword complexities not achievable by full words
Theoretical Computer Science, 2012 F Blanchet-Sadri
exaly +2 more sources
On the number of squares in partial words [PDF]
RAIRO - Theoretical Informatics and Applications, 2010 Summary: The theorem of Fraenkel and Simpson states that the maximum number of distinct squares that a word \(w\) of length \(n\) can contain is less than \(2n\). This is based on the fact that no more than two squares can have their last occurrences starting at the same position.
Vesa Halava, Tero Harju, Tomi Kärki
openaire +1 more source
Number of holes in unavoidable sets of partial words I
Journal of Discrete Algorithms, 2012 F Blanchet-Sadri
exaly +2 more sources
Covering Problems for Partial Words and for Indeterminate Strings [PDF]
International Symposium on Algorithms and Computation, 2014 We consider the problem of computing a solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position.
M. Crochemore +5 more
semanticscholar +1 more source
Partially abelian squarefree words [PDF]
RAIRO - Theoretical Informatics and Applications, 1990 A word of the form \(uu\), where \(u\) is a nonempty word, is called a square, and a word is squarefree if it contains no square as a factor (subword). It was shown already by A. Thue (1906) that for an alphabet with at least three letters there exist infinitely many squarefree words; for two letters the number is finite. An abelian square is a word of
Robert Cori, Maria Rosaria Formisano
openaire +2 more sources
Construction and analysis of the word network based on the Random Reading Frame (RRF) method [PDF]
Network Biology, 2021 In present study, a method was developed to construct and analyze the word network. The core of the method is Random Reading Frame (RRF) method. First, download or collect word files (in various formats, e.g., pdf, txt, doc, docx, rtf, html, etc.) from ...
WenJun Zhang
doaj