Kite和Dart Penrose平铺上的一般半全元胞自动机

AUTOMATA & JAC Pub Date : 2012-08-13 DOI:10.4204/EPTCS.90.21

Katsunobu Imai, Takahiro Hatsuda, V. Poupet, Kota Sato

{"title":"Kite和Dart Penrose平铺上的一般半全元胞自动机","authors":"Katsunobu Imai, Takahiro Hatsuda, V. Poupet, Kota Sato","doi":"10.4204/EPTCS.90.21","DOIUrl":null,"url":null,"abstract":"In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a semi-totalistic CA capable of simulating any boolean circuit on this aperiodic tiling.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings\",\"authors\":\"Katsunobu Imai, Takahiro Hatsuda, V. Poupet, Kota Sato\",\"doi\":\"10.4204/EPTCS.90.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a semi-totalistic CA capable of simulating any boolean circuit on this aperiodic tiling.\",\"PeriodicalId\":415843,\"journal\":{\"name\":\"AUTOMATA & JAC\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATA & JAC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.90.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATA & JAC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.90.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文研究了半全元胞自动机在罗杰·彭罗斯(Roger Penrose)提出的平面准周期风筝和飞镖二维平铺上的某些性质。我们表明，尽管底层网格的不规则性，但可以设计出能够在此非周期平铺上模拟任何布尔电路的半总体CA。

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

查看原文本刊更多论文

A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings

In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a semi-totalistic CA capable of simulating any boolean circuit on this aperiodic tiling.

求助全文

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

来源期刊

AUTOMATA & JAC

自引率

0.00%

发文量