Automatic complexity of Fibonacci and Tribonacci words
نویسندگان
چکیده
For a complexity function C, the lower and upper C-complexity rates of an infinite word x are C?(x)=lim infn??C(x?n)n,C¯(x)=lim supn??C(x?n)nrespectively. Here x?n is prefix length n. We consider case C=AN, nondeterministic automatic complexity. If these strictly between 0 1?2, we call them intermediate. Our main result that words having intermediate AN-rates exist, viz. Fibonacci Tribonacci words.
منابع مشابه
Determinantal Representations for Generalized Fibonacci and Tribonacci Numbers
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Using certain Hessenberg matrices, we provide some determinantal representations of the general terms of second-and third-order linear recurrence sequences with arbitrary initial values. Moreover, we provide explicit formu...
متن کاملDecision algorithms for Fibonacci-automatic Words, I: Basic results
We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) “Fibonacci-automatic”. This class includes, for example, the famous Fibonacci word f = 01001010 · · · , the fixed point of the morphism 0 → 01 and 1 → 0. We then recover many results about the Fibonacci word from the literature (and improve some of them), su...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولLyndon words and Fibonacci numbers
It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound ⌈log 2 (n)⌉ + 1 for the number of distinct Lyndon factors that a Lyndon word of length n must have, but this bound is not optimal. In this paper we show that a much more accurate lower bound is ⌈logφ(n)⌉ + 1, where φ denotes the gol...
متن کاملAbelian complexity function of the Tribonacci word
According to a result of Richomme, Saari and Zamboni, the abelian complexity of the Tribonacci word satisfies ρab(n) ∈ {3, 4, 5, 6, 7} for each n ∈ N. In this paper we derive an automaton that evaluates the function ρab(n) explicitly. The automaton takes the Tribonacci representation of n as its input; therefore, (ρ(n))n∈N is an automatic sequence in a generalized sense. Since our evaluation of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2020.10.014