Search results for "Alphabet"
showing 10 items of 68 documents
Constructing Antidictionaries of Long Texts in Output-Sensitive Space
2021
AbstractA wordxthat is absent from a wordyis calledminimalif all its proper factors occur iny. Given a collection ofkwordsy1, … ,ykover an alphabetΣ, we are asked to compute the set$\mathrm {M}^{\ell }_{\{y_1,\ldots ,y_k\}}$M{y1,…,yk}ℓof minimal absent words of length at mostℓof the collection {y1, … ,yk}. The set$\mathrm {M}^{\ell }_{\{y_1,\ldots ,y_k\}}$M{y1,…,yk}ℓcontains all the wordsxsuch thatxis absent from all the words of the collection while there existi,j, such that the maximal proper suffix ofxis a factor ofyiand the maximal proper prefix ofxis a factor ofyj. In data compression, this corresponds to computing the antidictionary ofkdocuments. In bioinformatics, it corresponds to c…
Phonological false recognition produced by bottom-up automatic activation in young and older people
2018
Two experiments explored a new procedure to implicitly induce phonological false memories in young and older people. On the study tasks, half of the words were formed from half of the letters in the alphabet, whereas the remaining words were formed from all the letters in the alphabet. On the recognition tests, there were three types of non-studied new words: critical lures formed from the same half of the letters as the studied words; distractors formed from the other half of the letters not used, and distractors formed from all the letters in the alphabet. In both experiments, the results showed that, in both young and older people, critical lures produced more false recognitions than dis…
Perceiving numbers alters time perception.
2008
The representation of time, space and numbers are strictly linked in the primate's cognitive system. Here we show that merely looking at number symbols biases a temporal judgment on their duration depending upon the number's magnitude. In a first experiment, a group of healthy subjects was submitted to a time estimation task, requiring to judge whether the duration of a test stimulus was longer or shorter than that of a previous reference fixed stimulus (digit 5; duration 300 ms). Test stimuli were the digits 1, 5 and 9 ranging between 250 and 350 ms. The main results showed that temporal perception was biased according to the magnitude expressed by the digit: low digits (i.e. 1) leading to…
Ḥurūf al-tāǧ wa-ʻalāmāt al-tarqīm wa-mawāḍiʻ istiʻmāluhā
1931
"Kroņa raksts un pieturzīmes un to novietojums" - par arābu valodas ortogrāfijas reformu (lielo burtu izmantošanas ieviešanai un pieturzīmju lietošanas sakārtošanai). Ārējos informācijas avotos minēts arī ar nosaukumu angļu valodā "Crown letters and punctuation and their placements."
The rise of the middle author: Investigating collaboration and division of labor in biomedical research using partial alphabetical authorship
2017
Contemporary biomedical research is performed by increasingly large teams. Consequently, an increasingly large number of individuals are being listed as authors in the bylines, which complicates the proper attribution of credit and responsibility to individual authors. Typically, more importance is given to the first and last authors, while it is assumed that the others (the middle authors) have made smaller contributions. However, this may not properly reflect the actual division of labor because some authors other than the first and last may have made major contributions. In practice, research teams may differentiate the main contributors from the rest by using partial alphabetical author…
Adding symbolic information to picture models: definitions and properties
2005
AbstractIn the paper we propose extensions of some picture models, such as colored, drawn and pixel pictures. Such extensions are conceived by observing that a picture may embed more information than the shape, such as colors, labels, etc., which can be represented by a symbol from an alphabet and can be associated to segments, points or pixels. New interesting issues derived from the introduction of symbols will be investigated together with some complexity and decidability questions for the proposed extensions.
The dual equivalence of equations and coequations for automata
2015
The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of equations and coequations. For every automaton ( X , α ) , we define two new automata: free ( X , α ) and cofree ( X , α ) representing, respectively, the greatest set of equations and the smallest set of coequations satisfied by ( X , α ) . Both constructions are shown to be functorial. Our main result is that the restrictions of free and cofree to, respectively, preformations of languages and to quotients A * / C of A * with respect to a congr…
Burrows-Wheeler transform and palindromic richness
2009
AbstractThe investigation of the extremal case of the Burrows–Wheeler transform leads to study the words w over an ordered alphabet A={a1,a2,…,ak}, with a1<a2<⋯<ak, such that bwt(w) is of the form aknkak−1nk−1⋯a2n2a1n1, for some non-negative integers n1,n2,…,nk. A characterization of these words in the case |A|=2 has been given in [Sabrina Mantaci, Antonio Restivo, Marinella Sciortino, Burrows-Wheeler transform and Sturmian words, Information Processing Letters 86 (2003) 241–246], where it is proved that they correspond to the powers of conjugates of standard words. The case |A|=3 has been settled in [Jamie Simpson, Simon J. Puglisi, Words with simple Burrows-Wheeler transforms, Electronic …
Balance Properties and Distribution of Squares in Circular Words
2008
We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalised to non periodic infinite words as well.
A Characterization of Bispecial Sturmian Words
2012
A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of segments in the Euclidean plane. This result is an extension of the known relation between central words and primitive Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the set of Sturmian wo…