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
{"title":"On recursive tiling of some mathematical objects","authors":"Andrew L. Szilard","doi":"10.1016/j.tcs.2024.114781","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1022 ","pages":"Article 114781"},"PeriodicalIF":0.9000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524003980","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
论某些数学对象的递归平铺
这篇文章以一种新颖的方式,利用多米诺骨牌、方形瓦片、连锁瓦片和流动瓦片等各种瓦片,将递归定义的、可能无限的数学对象(如二进制代码表和空间填充希尔伯特曲线的变体)可视化为近似值。通过将这些瓦片对象定义为 L 系统,我们可以看到 L 系统的威力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Theoretical Computer Science
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.
期刊最新文献
Editorial Board Editorial Board Towards strong regret minimization sets: Balancing freshness and diversity in data selection Adding direction constraints to the 1-2-3 Conjecture Chemical mass-action systems as analog computers: Implementing arithmetic computations at specified speed
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1