منابع مشابه
On scattered subword complexity
Sequences of characters called words or strings are widely studied in combinatorics, and used in various fields of sciences (e.g. chemistry, physics, social sciences, biology [2, 3, 4, 11] etc.). The elements of a word are called letters. A contiguous part of a word (obtained by erasing a prefix or/and a suffix) is a subword or factor. If we erase arbitrary letters from a word, what is obtained...
متن کاملSubword-Based Text Retrieval
Document retrieval in languages with a rich and complex morphology – particularly in terms of derivation and (single-word) composition – suffers from serious performance degradation with the stemming-only query-term-totext-word matching paradigm. We propose an alternative approach in which morphologically complex word forms are segmented into relevant subwords (such as stems, prefixes, suffixes...
متن کاملAsymptotic Subword Complexity
The subword complexity of an infinite word ξ is a function f (ξ, n) returning the number of finite subwords (factors, infixes) of length n of ξ. In the present paper we investigate infinite words for which the set of subwords occurring infinitely often is a regular language. Among these infinite words we characterise those which are eventually recurrent. Furthermore, we derive some results comp...
متن کاملSubword complexities and iteration
This paper is an overview of results' on the subword complexity of various classes of languages obtained by iterating a mapping, and more precisely on the asymptotic behaviour of this complexity. In the first section we consider iterated morphisms, that is DOL languages. In this area the subword complexity falls into one of five classes, and class membership can be determined. The second sectio...
متن کاملAutomorphisms of subword-posets
In this paper the automorphism group of two posets, Dk,n and Bm,n is determined. Dk,n is the poset of DNA strands of length at most n, built up with k complement pairs of letters, and partially ordered by the subsequence relation. Bm,n is the set of all subsequences of the word um,n = a1...an defined over the alphabet {0, 1, ..., (m−1)}, where ai ≡ i (mod m). The automorphism group of Bm,n was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90143-x