Results 21 to 30 of about 451,601 (187)
Extremal words in morphic subshifts [PDF]
Given an infinite word X over an alphabet A a letter b occurring in X, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of X an extremal word of X.
Currie, James D. +3 more
core +2 more sources
We may usefully distinguish between internal and external questions when discussing the use of primitives for representing natural language content and doing related semantic computations. Here I shall give a few examples of internal questions; go on to explain why I shall turn immediately to external questions; and finally discuss two of the latter ...
openaire +1 more source
Componential analysis is a method of semantic analysis based on the assumption that the meaning of words can be adequately described by a set of primitive semantic ...
Willems, Klaas
core +1 more source
Random Operator Approach for Word Enumeration in Braid Groups [PDF]
We investigate analytically the problem of enumeration of nonequivalent primitive words in the braid group B_n for n >> 1 by analysing the random word statistics and the target space on the basis of the locally free group approximation.
Alain Comtet +35 more
core +3 more sources
Revisiting environmental concern: the role of the United Nations in development management
The intervention of global capital through primitive accumulation is causing immense economic and ecological suffering, particularly among the poorer areas of the less-developed world.
Santanu Rakshit
doaj +1 more source
Patrick Süskind’s Das Parfum: Die Geschichte eines Mörders presents a sort of Janus-figure, gazing backwards toward the primitive form of life (Grenouille’s Romantic deliverance) and forward toward an Enlightenment anthropocentric mechanism (an allusion ...
Justine Shu-Ting Kao
doaj +1 more source
Note on Marsaglia\'s Xorshift Random Number Generators
Marsaglia (2003) has described a class of Xorshift random number generators (RNGs) with periods 2n - 1 for n = 32, 64, etc. We show that the sequences generated by these RNGs are identical to the sequences generated by certain linear feedback shift ...
Richard P. Brent
doaj +1 more source
Slowly synchronizing automata and digraphs [PDF]
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states.
A.L. Dulmage +20 more
core +4 more sources
We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g.
Juhani Karhumaki +2 more
doaj +1 more source
Conditions for Primitivity of unital amalgamated full free products of finite dimensional C*-algebras [PDF]
We consider amalgamated unital full free products of the form $A_1*_DA_2$, where $A_1, A_2$ and $D$ are finite dimensional C*-algebras and there are faithful traces on $A_1$ and $A_2$ whose restrictions to $D$ agree.
Torres-Ayala, Francisco
core +1 more source

