网格路径和普劳赫-休-莫尔序列

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

Theoretical Computer Science Pub Date : 2024-09-24 DOI:10.1016/j.tcs.2024.114885

Shishuo Fu, Bing Gao

引用次数: 0

摘要

利用弗拉约莱（Flajolet）的续分数组合理论和网格路径的轴对称性，我们证明了枚举某些网格路径的模数二可以得到无处不在的普鲁赫特-休-莫尔斯序列。这回答了 Berstel 等人的一个未决问题。

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

查看原文本刊更多论文

Lattice paths and the Prouhet-Thue-Morse sequence

Using Flajolet's combinatorial theory of continued fractions and axial symmetry of lattice paths, we show that the enumeration of certain lattice paths modulo two yields the ubiquitous Prouhet-Thue-Morse sequence. This answers an open problem of Berstel et al.

求助全文

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

来源期刊

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.