Results 31 to 40 of about 3,800,669 (273)
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.
Francine Blanchet-Sadri +2 more
openaire +2 more sources
A generalization of Thue freeness for partial words
Theoretical Computer Science, 2009 F Blanchet-Sadri, Robert Mercaş
exaly +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
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
Overlap-freeness in infinite partial words
Theoretical Computer Science, 2009 Vesa Halava, Tero Harju, Tomi Karki
exaly +2 more sources
Partial words with a unique position starting a square [PDF]
Information Processing Letters, 2018 We consider partial words with a unique position starting a power. We show that over a k letter alphabet, a partial word with a unique position starting a square can contain at most k squares.
John M. Machacek
semanticscholar +1 more source
Universal partial words over non-binary alphabets [PDF]
Theoretical Computer Science, 2016 Chen, Kitaev, Mutze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow for a wild-card character ⋄, which is a placeholder for any letter in the ...
Bennet Goeckner +6 more
semanticscholar +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