منابع مشابه
Relational codes of words
We consider words, i.e., strings over a finite alphabet together with a compatibility relation induced by a relation on letters. This notion generalizes that of partial words. The theory of codes on combinatorics on words is revisited by defining (R, S)-codes for arbitrary relations R and S. We describe an algorithm to test whether or not a finite set of words is an (R, S)-code. Coding properti...
متن کاملRelational Fine and Wilf words
We consider interaction properties of relational periods, where the relation is a compatibility relation on words induced by a relation on letters. By the famous theorem of Fine and Wilf, p + q − gcd(p, q) − 1 is the maximal length of a word having periods p and q but not period gcd(p, q). Such words of maximal length are called extremal Fine and Wilf words. In this paper we study properties of...
متن کاملA WORLD OF RELATIONS Relational Words
Children climb on jungle gyms, run around trees, and kiss their parents. The everyday world in which we live is fundamentally dynamic, with events defined in terms of the relations that objects have to actions. When we label these events and relations, we use relational words that come in all forms. They can be nouns such as brother, island, and passenger (Hall & Waxman, 1993; Keil & Batterman,...
متن کاملCodes, orderings, and partial words
Codes play an important role in the study of the combinatorics of words. In this paper, we introduce pcodes that play a role in the study of combinatorics of partial words. Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. Pcodes are defined in terms of the compatibility relation that considers two strings over the same alphabet that are equal ...
متن کاملBifix codes and Sturmian words
We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes maximal in a recurrent set F of words (F -maximal bifix codes). In the case of bifix codes contained in Sturmian sets of words, we obtain several new results. Let F be a Sturmian set of words. Our results express the fact that an F -maximal bifix code of degree d behaves...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.09.011