Parity Index of Binary Words and Powers of Prime Words
نویسندگان
چکیده
منابع مشابه
Parity Index of Binary Words and Powers of Prime Words
Let f be a binary word and let Fd(f) be the set of words of length d which do not contain f as a factor (alias words that avoid the pattern f). A word is called even/odd if it contains an even/odd number of 1s. The parity index of f (of dimension d) is introduced as the difference between the number of even words and the number of odd words in Fd(f). A word f is called prime if every nontrivial...
متن کاملOn powers of words occurring in binary codings of rotations
We discuss combinatorial properties of a class of binary sequences generalizing Sturmian sequences and obtained as a coding of an irrational rotation on the circle with respect to a partition in two intervals. We give a characterization of those having a finite index in terms of a two-dimensional continued fraction like algorithm, the so-called D-expansion. Then, we discuss powers occurring at ...
متن کاملthe effect of translation versus matching words and definitions on retrieval of vocabulary among iranian intermediate efl learners
این تحقیق جهت بررسی تأثیر ترجمه در برابر ایجاد ارتباط بین لغات و ارائه معانی بر بازیابی واژگان در میان زبان آموزان متوسط ایرانی انجام شده است. به این منظور سه گروه کامل از دانش آموزان سطح متوسط که کتاب اینترچنج3 را مطالعه می کردند پس از انجام تست استاندارد مهارت سنجی انتخاب شدند. در ابتدا محقق آنها را به دو گروه آزمایشی و یک گروه کنترل یا شاهد تقسیم نمود و درمرحله بعد از کلیه دانش آموزان در سه ...
Deleting Powers in Words
We consider the language consisting of all words such that it is possible to obtain the empty word by iteratively deleting powers. It turns out that in the case of deleting squares in binary words this language is regular, and in the case of deleting squares in words over a larger alphabet the language is not regular. However, for deleting squares over any alphabet we find that this language ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2178