用细胞自动机构建闵科夫斯基和

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-24 DOI:arxiv-2406.16419

Pierre-Adrien TahayLoria, Université de Lorraine

{"title":"用细胞自动机构建闵科夫斯基和","authors":"Pierre-Adrien TahayLoria, Université de Lorraine","doi":"arxiv-2406.16419","DOIUrl":null,"url":null,"abstract":"We give a construction in a column of a one-dimensional cellular automaton of\nthe Minkowski sum of two sets which can themselves occur in columns of cellular\nautomata. It enables us to obtain another construction of the set of integers\nthat are sums of three squares, answering a question by the same author.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"42 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Construction of Minkowski Sums by Cellular Automata\",\"authors\":\"Pierre-Adrien TahayLoria, Université de Lorraine\",\"doi\":\"arxiv-2406.16419\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a construction in a column of a one-dimensional cellular automaton of\\nthe Minkowski sum of two sets which can themselves occur in columns of cellular\\nautomata. It enables us to obtain another construction of the set of integers\\nthat are sums of three squares, answering a question by the same author.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"42 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.16419\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.16419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们在一维蜂窝自动机的一列中给出了两个集合的闵科夫斯基和的构造，这两个集合本身也可以出现在蜂窝自动机的列中。这使我们能够获得另一种关于三个正方形之和的整数集合的构造，从而回答了同一作者提出的一个问题。

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

查看原文本刊更多论文

Construction of Minkowski Sums by Cellular Automata

We give a construction in a column of a one-dimensional cellular automaton of the Minkowski sum of two sets which can themselves occur in columns of cellular automata. It enables us to obtain another construction of the set of integers that are sums of three squares, answering a question by the same author.

求助全文

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

来源期刊

arXiv - CS - Formal Languages and Automata Theory

自引率

0.00%

发文量