We investigate some properties of abelian return words as recently introduced by Puzynina and Zamboni. In particular, we obtain a characterization of Sturmian words with nonzero intercept in terms of the finiteness of the set of abelian return words to all prefixes. We describe this set of abelian returns for the Fibonacci word but also for the 2-automatic Thue–Morse word. We also investigate t...

In (1a), the verb shows subject agreement with 'Alemu (3sm)' and object agreement with 'the dead cat (3sm)'. Probably due to the strong verbal agreement, a null pronominal (‘pro’) can be used as the subject (or the object), as in (1b). Besides agreement-marking, Chaha verbs host prefixes to yield transitivity alternations, passivization, and causativization. Hetzron’s (1977) summary of the thre...

The Etymologies (as found in The Lost Road and in the “Addenda and Corrigenda to the Etymologies” published in Vinyar Tengwar 45 and 46) include several examples of forms that are denoted as “intensified” by Tolkien, among them those that are formed by a prefix. The entry A‐ (VT45:5) is perhaps the best starting point for a classification of these intensified forms. We learn there of an intensi...

We study powers of prefixes of Sturmian words.

The Sequence PredIction ChallengE (SPiCe) is an on-line competition that took place between March and July 2016. Each of the 15 problems was made of a set of whole sequences as training sample, a validation set of prefixes, and a test set of prefixes. The aim was to submit a ranking of the 5 most probable symbols to be the next symbol of each prefix.

A single physical link can have multiple prefixes assigned to it. In that environment, end hosts might have multiple IP addresses and be required to use them selectively. RFC 3484 defines default source and destination address selection rules and is implemented in a variety of OSs. But, it has been too difficult to use operationally for several reasons. In some environments where multiple prefi...

The article consists of two parts: the first one deals with the concept of the prefixes of a finite sequence, the second one introduces and deals with the concept of tree. Besides some auxiliary propositions concerning finite sequences are presented. The trees are introduced as non-empty sets of finite sequences of natural numbers which are closed on prefixes and on sequences of less numbers (i...

An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of ―do not know‖ symbols. We extend a result of Ehrenfeucht and Silberger which states that if a word u can be written as a concatenation of nonem...

This qualitative study examined concept formation of Latin prefixes in three students diagnosed with learning disabilities through a theme-based analysis. The study had two purposes. Conceptual processes underlying the learning of Latin prefixes were explored through dynamic assessment and Vygotsky’s stages of concept formation were empirically tested. There were five major findings in this stu...

In this paper we develop a mathematical model to capture BGP table fluctuations. This provides the necessary foundations to study shortand long-term routing table growth. We reason that this growth is operationally critical for network administrators who need to gauge the amount of memory to install in routers as well as being a potential deciding factor in determining when the Internet communi...