Results 251 to 260 of about 24,121 (290)
Movement beyond data: epistemic and pictorial challenges in understanding moving life. [PDF]
Wellmann J.
europepmc +1 more source
On the grammar of restricted-range numeral systems. [PDF]
Bowern C.
europepmc +1 more source
Assembly of Face Decorated Cuboidal Cages into Ultraporous Structures with Hierarchical Porosity: Accessing MOFs with the Awaited <b>red-a</b> Topology. [PDF]
Froudas KG +9 more
europepmc +1 more source
Primary Renal Synovial Sarcoma: A Report of a Rare Case and Management Approach. [PDF]
Mondal S +4 more
europepmc +1 more source
Symbolically Regressing Fish Biomass Spectral Data: A Linear Genetic Programming Method With Tunable Primitives. [PDF]
Huang Z +5 more
europepmc +1 more source
Practice as research as a decolonial praxis: Yoruba culture retrieval. [PDF]
Rose L.
europepmc +1 more source
The aim of this article is to investigate the properties of primitive words with respect to insertion operation, called ins-primitive words. This includes the investigation of properties concerning primitive words (with respect to catenation operation) in order to show our result concerning the self-insertion of a word. We also show that the set of all
H. K. Hsiao, Y. T. Yeh, S. S. Yu
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Applied Mathematics, 2001
The author counts the primitive words of given length on a finite alphabet, as well as the ``exchangeable'' primitive words on a finite alphabet (a word is noexchangeable primitive if the word obtained by applying any permutation to the letters is still primitive). The first result is well known and can be found in any book on combinatorics on words (a
exaly +2 more sources
The author counts the primitive words of given length on a finite alphabet, as well as the ``exchangeable'' primitive words on a finite alphabet (a word is noexchangeable primitive if the word obtained by applying any permutation to the letters is still primitive). The first result is well known and can be found in any book on combinatorics on words (a
exaly +2 more sources
Counting bordered and primitive words with a fixed weight
A word w is primitive if it is not a proper power of another word, and w is unbordered if it has no prefix that is also a suffix of w. We study the number of primitive and unbordered words w with a fixed weight, that is, words for which the Parikh vector
Tero Harju, Dirk Nowotka
exaly +2 more sources

