关于数字段和平衡词的一些结果

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-10-24 DOI:10.1016/j.tcs.2024.114935

Alessandro De Luca, Gabriele Fici

引用次数: 0

摘要

我们展示了 Christoffel 词和二进制平衡词的组合结果，这些结果是由它们作为数字段近似值的几何解释所激发的。我们给出了一个封闭公式，用于计算有 a 个 0 和 b 个 1 的平衡词的精确数量。我们还研究了最小非平衡词。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some results on digital segments and balanced words

We exhibit combinatorial results on Christoffel words and binary balanced words that are motivated by their geometric interpretation as approximations of digital segments. We give a closed formula for counting the exact number of balanced words with a zeroes and b ones. We also study minimal non-balanced words.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.