On recursive tiling of some mathematical objects

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

Theoretical Computer Science Pub Date : 2024-09-12 DOI:10.1016/j.tcs.2024.114781

Andrew L. Szilard

引用次数: 0

Abstract

This essay, in a novel way, uses various tiles, such as dominoes, square-, interlocking-, and flow-tiles, to visualize approximations to recursively defined, potentially infinite mathematical objects, such as binary code tables, and variants of the space-filling Hilbert curve. The power of L-systems is shown by defining these tiled objects as L-systems.

查看原文本刊更多论文

论某些数学对象的递归平铺

这篇文章以一种新颖的方式，利用多米诺骨牌、方形瓦片、连锁瓦片和流动瓦片等各种瓦片，将递归定义的、可能无限的数学对象（如二进制代码表和空间填充希尔伯特曲线的变体）可视化为近似值。通过将这些瓦片对象定义为 L 系统，我们可以看到 L 系统的威力。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

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.