Results 11 to 20 of about 2,321,578 (281)
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 +9 more sources
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 +4 more sources
Effects of word length, contextual support, and prior second language proficiency on the learning of technical words in a second language. [PDF]
PLoS ONESecond language (L2) learners often struggle with learning technical words in a new discipline. Previous studies suggested that word length and context may differentially affect orthographic and semantic acquisition during initial L2 word learning.
Jie Wang, Yen Na Yum
doaj +2 more sources
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
Equations on partial words [PDF]
RAIRO - Theoretical Informatics and Applications, 2006 Summary: It is well-known that some of the most basic properties of words, like the commutativity \((xy = yx)\) and the conjugacy \((xz = zy)\), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution.
Blanchet-Sadri, Francine +2 more
openaire +2 more sources
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
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
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
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blanchet-Sadri, F., Luhmann, D.K.
openaire +2 more sources
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