发布求助
文献互助 智能选刊 最新文献

AUTOMATA & JAC最新文献

筛选
英文 中文
Local Rules for Computable Planar Tilings 可计算平面平铺的局部规则
AUTOMATA & JAC Pub Date : 2012-08-14 DOI: 10.4204/EPTCS.90.11
Thomas Fernique, M. Sablik
{"title":"Local Rules for Computable Planar Tilings","authors":"Thomas Fernique, M. Sablik","doi":"10.4204/EPTCS.90.11","DOIUrl":"https://doi.org/10.4204/EPTCS.90.11","url":null,"abstract":"Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question is to characterize, among a class of non-periodic tilings, the aperiodic ones. In this paper, we answer this question for the well-studied class of non-periodic tilings obtained by digitizing irrational vector spaces. Namely, we prove that such tilings are aperiodic if and only if the digitized vector spaces are computable.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Boolean networks synchronism sensitivity and XOR circulant networks convergence time 布尔网络的同步灵敏度和异或循环网络的收敛时间
AUTOMATA & JAC Pub Date : 2012-08-14 DOI: 10.4204/EPTCS.90.4
Mathilde Noual, Damien Regnault, Sylvain Sené
{"title":"Boolean networks synchronism sensitivity and XOR circulant networks convergence time","authors":"Mathilde Noual, Damien Regnault, Sylvain Sené","doi":"10.4204/EPTCS.90.4","DOIUrl":"https://doi.org/10.4204/EPTCS.90.4","url":null,"abstract":"In this paper are presented first results of a theoretical study on the role of non-monotone interactions in Boolean automata networks. We propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours according to two axes. The first one consists in supporting the idea that non-monotony has a peculiar influence on the sensitivity to synchronism of such networks. It leads us to the second axis that presents preliminary results and builds an understanding of the dynamical behaviours, in particular concerning convergence speeds, of specific non-monotone Boolean automata networks called XOR circulant networks.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121899677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
On the Parity Problem in One-Dimensional Cellular Automata 一维元胞自动机的奇偶性问题
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.9
Heather Betel, P. D. Oliveira, P. Flocchini
{"title":"On the Parity Problem in One-Dimensional Cellular Automata","authors":"Heather Betel, P. D. Oliveira, P. Flocchini","doi":"10.4204/EPTCS.90.9","DOIUrl":"https://doi.org/10.4204/EPTCS.90.9","url":null,"abstract":"We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initial configuration contains an odd number of 1s, the lattice should converge to all 1s; otherwise, it should converge to all 0s. It is easy to see that the problem is ill-defined for even-sized lattices (which, by definition, would never be able to converge to 1). We then consider only odd lattices. \u0000We are interested in determining the minimal neighbourhood that allows the problem to be solvable for any initial configuration. On the one hand, we show that radius 2 is not sufficient, proving that there exists no radius 2 rule that can possibly solve the parity problem from arbitrary initial configurations. On the other hand, we design a radius 4 rule that converges correctly for any initial configuration and we formally prove its correctness. Whether or not there exists a radius 3 rule that solves the parity problem remains an open problem.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129874342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Computing by Temporal Order: Asynchronous Cellular Automata 时间顺序计算:异步元胞自动机
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.14
M. Vielhaber
{"title":"Computing by Temporal Order: Asynchronous Cellular Automata","authors":"M. Vielhaber","doi":"10.4204/EPTCS.90.14","DOIUrl":"https://doi.org/10.4204/EPTCS.90.14","url":null,"abstract":"Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case), under all possible update rules (asynchronicity). \u0000Over the torus Z/nZ (n<= 11),we will see that the ECA with Wolfram rule 57 maps any v in F_2^n to any w in F_2^n, varying the update rule. \u0000We furthermore show that all even (element of the alternating group) bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57, by iterating it a sufficient number of times with varying update rules, at least for n <= 10. We characterize the non-bijective functions computable by asynchronous rules.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131066064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata 一维可逆保数元胞自动机的通用性
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.12
K. Morita
{"title":"Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata","authors":"K. Morita","doi":"10.4204/EPTCS.90.12","DOIUrl":"https://doi.org/10.4204/EPTCS.90.12","url":null,"abstract":"18th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA & JAC 2012), La Marana, Corsica, France, September 20, 2012.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125781707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata 多维元胞自动机的简单最优时间FSSP算法
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.13
H. Umeo, Kinuo Nishide, Keisuke Kubo
{"title":"A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata","authors":"H. Umeo, Kinuo Nishide, Keisuke Kubo","doi":"10.4204/EPTCS.90.13","DOIUrl":"https://doi.org/10.4204/EPTCS.90.13","url":null,"abstract":"The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a simple recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle arrays of size m n with a general at one corner in m+ n+ max(m; n) 3 steps. The algorithm is a natural expansion of the well-known FSSP algorithms proposed by Balzer [1967], Gerken [1987], and Waksman [1966] and it can be easily expanded to three-dimensional arrays, even to multi-dimensional arrays with a general at any position of the array. The algorithm proposed is isotropic concerning the side-lengths of multi-dimensional arrays and its algorithmic correctness is transparent and easily verified.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130040291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology 元胞自动机的拓扑启发问题及拓扑反例
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.5
Ville Salo, Ilkka Törmä
{"title":"Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology","authors":"Ville Salo, Ilkka Törmä","doi":"10.4204/EPTCS.90.5","DOIUrl":"https://doi.org/10.4204/EPTCS.90.5","url":null,"abstract":"We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also, reversible automata form a closed set, while surjective ones are dense. The second topology, which is induced by a metric, is studied in more detail. Continuity of composition (under certain restrictions) and inversion, as well as closedness of the set of surjective automata, are proved, and some counterexamples are given. We then generalize this space, in the sense that every shift-invariant measure on the configuration space induces a pseudometric on cellular automata, and study the properties of these spaces. We also characterize the pseudometric spaces using the Besicovitch distance, and show a connection to the first (pathological) space.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123289374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Entry times in automata with simple defect dynamics 具有简单缺陷动力学的自动机的进入时间
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.8
Benjamin Hellouin de Menibus, M. Sablik
{"title":"Entry times in automata with simple defect dynamics","authors":"Benjamin Hellouin de Menibus, M. Sablik","doi":"10.4204/EPTCS.90.8","DOIUrl":"https://doi.org/10.4204/EPTCS.90.8","url":null,"abstract":"In this paper, we consider a simple cellular automaton with two particles of different speeds that annihilate on contact. Following a previous work by Kurka et al., we study the asymptotic distribution, starting from a random configuration, of the waiting time before a particle crosses the central column after time n. Drawing a parallel between the behaviour of this automata on a random initial configuration and a certain random walk, we approximate this walk using a Brownian motion, and we obtain explicit results for a wide class of initial measures and other automata with similar dynamics.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123347649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Strictly Temporally Periodic Points in Cellular Automata 元胞自动机中的严格时间周期点
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.18
A. Dennunzio, P. Lena, L. Margara
{"title":"Strictly Temporally Periodic Points in Cellular Automata","authors":"A. Dennunzio, P. Lena, L. Margara","doi":"10.4204/EPTCS.90.18","DOIUrl":"https://doi.org/10.4204/EPTCS.90.18","url":null,"abstract":"We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for almost equicontinuous surjective cellular automata while it is empty for the positively expansive ones. In the class of additive cellular automata, the set of strictly periodic points can be either dense or empty. The latter happens if and only if the cellular automaton is topologically transitive.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124568252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Fixed Parameter Undecidability for Wang Tilesets 固定参数不可判定的王瓷砖集
AUTOMATA & JAC Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90.6
E. Jeandel, N. Rolin
{"title":"Fixed Parameter Undecidability for Wang Tilesets","authors":"E. Jeandel, N. Rolin","doi":"10.4204/EPTCS.90.6","DOIUrl":"https://doi.org/10.4204/EPTCS.90.6","url":null,"abstract":"Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the tiling problem remains undecidable if the difference between the number of tiles and the number of colors is bounded by 43. One of the main new tool is the concept of Wang bars, which are equivalently inflated Wang tiles or thin polyominoes.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115429028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信