广义Fibonacci递归与lex-least De Bruijn序列
Generalized Fibonacci recurrences and the lex-least De Bruijn sequence
摘要：
二进制字符串的偏斜是0的数量和1的数量之差，而字符串的长度是这两个数字的总和。我们认为某些后缀的字典最少的de Bruijn序列在自然断点的二进制字符串。我们表明，这些后缀的倾斜度和长度列举的序列推广斐波那契和卢卡斯数，分别。
英文摘要：
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographically-least de Bruijn sequence at natural breakpoints of the binary string. We show that the skew and length of these suffixes are enumerated by sequences generalizing the Fibonacci and Lucas numbers, respectively.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
