Results 1 to 10 of about 1,113 (66)
Electronic Proceedings in Theoretical Computer Science, 2011 Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial word w,
Francine Blanchet-Sadri +4 more
doaj +1 more source
On universal partial words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly).
Herman Z. Q. Chen +3 more
doaj +1 more source
Inference of partial colexifications from multilingual wordlists
Frontiers in Psychology, 2023 The past years have seen a drastic rise in studies devoted to the investigation of colexification patterns in individual languages families in particular and the languages of the world in specific.
Johann-Mattis List, Johann-Mattis List
doaj +1 more source
Unavoidable Sets of Partial Words of Uniform Length [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X.
Joey Becker +3 more
doaj +1 more source
To some structural properties of ∞ - languages
Ratio Mathematica, 2022 Properties of catenation of sequences of finite (words) and infinite ( lengths are largely studied in formal language theory. These operations are derived from the mechanism how they are accepted or generated by the corresponding devices.
Ivan Mezník
doaj +1 more source
PARTIAL GLOSSECTOMY IN TWO HORSES [PDF]
Assiut Veterinary Medical Journal, 1996 Two adult male horses 5 and 8 years old were admitted to the Veterinary Teaching Hospital of king Faisal University for evaluation of their incised wounds in the distal third of their tongues.
M. R. ABDIN-BEY, R.O. RAMADAN
doaj +1 more source
Dyck Words, Lattice Paths, and Abelian Borders [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al.
F. Blanchet-Sadri +2 more
doaj +1 more source
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
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
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