標(biāo)題: Titlebook: Cellular Automata and Discrete Complex Systems; 21st IFIP WG 1.5 Int Jarkko Kari Conference proceedings 2015 IFIP International Federation [打印本頁] 作者: 遮蔽 時(shí)間: 2025-3-21 18:28
書目名稱Cellular Automata and Discrete Complex Systems影響因子(影響力)
書目名稱Cellular Automata and Discrete Complex Systems影響因子(影響力)學(xué)科排名
書目名稱Cellular Automata and Discrete Complex Systems網(wǎng)絡(luò)公開度
書目名稱Cellular Automata and Discrete Complex Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Cellular Automata and Discrete Complex Systems被引頻次
書目名稱Cellular Automata and Discrete Complex Systems被引頻次學(xué)科排名
書目名稱Cellular Automata and Discrete Complex Systems年度引用
書目名稱Cellular Automata and Discrete Complex Systems年度引用學(xué)科排名
書目名稱Cellular Automata and Discrete Complex Systems讀者反饋
書目名稱Cellular Automata and Discrete Complex Systems讀者反饋學(xué)科排名
作者: 狂熱文化 時(shí)間: 2025-3-21 22:34
A Physically Universal Quantum Cellular Automaton,tions to be done directly on the cells. We discuss physical universality in general, the issues specific to the quantum setting, and give an example of a quantum cellular automaton achieving a quantum definition of physical universality.作者: configuration 時(shí)間: 2025-3-22 02:42
Effect of Graph Structure on the Limit Sets of Threshold Dynamical Systems,s partitioned into blocks, and the blocks are updated sequentially while the vertices within each block are updated in parallel. There are several notable previous results concerning the two extreme cases of block-sequential update: (i)?sequential and (ii)?parallel. While parallel threshold systems 作者: 感激小女 時(shí)間: 2025-3-22 08:06
A Cellular Automaton for Blocking Queen Games,cellular automaton. The game, known as ., consists of moving a queen as in chess, but always towards?(0,0), and it may not be moved to any of . temporarily “blocked” positions specified on the previous turn by the other player. The game ends when a player wins by blocking all possible moves of the o作者: 恃強(qiáng)凌弱的人 時(shí)間: 2025-3-22 11:50
Hard Core via PCA: Entropy Bounds,ncreasing sequence of lower bounds for the topological entropy. Additionally the procedure gives some insight on the support of the measure of maximal entropy. The method also applies to other lattices and models with appropriate sublattice splitting.作者: Gesture 時(shí)間: 2025-3-22 14:20
Classification of Elementary Cellular Automata Up to Topological Conjugacy,llular automata. In this article, we investigate different invariants for topological conjugacy in order to distinguish between non-conjugate systems. In particular we show how to compute the cardinality of the set of points with minimal period . for one-dimensional CA. Applying these methods to the作者: Gesture 時(shí)間: 2025-3-22 19:41
Remarks on the Cellular Automaton Global Synchronisation Problem,e study this inverse problem for one-dimensional binary systems with periodic boundary conditions (i.e., rings). For small neighbourhoods, we present results obtained with the formulation of the problem as a SAT problem and the use of SAT solvers. Our observations suggest that it is not possible to 作者: 把手 時(shí)間: 2025-3-23 00:55
L-Convex Polyominoes Are Recognizable in Real Time by 2D Cellular Automata,ional language representing such polyominoes has been recently proved to be recognizable by tiling systems by S.?Brocchi, A.?Frosini, R.?Pinzani and S.?Rinaldi. In an attempt to compare recognition power of tiling systems and cellular automata, we have proved that this language can be recognized by 作者: ICLE 時(shí)間: 2025-3-23 01:21
Shrinking One-Way Cellular Automata,onal property that during a computation any cell of the . has the ability to dissolve itself and we call this model shrinking one-way cellular automata (.). It turns out that real-time . are more powerful than real-time ., since they can accept certain linear-time . languages. Additionally, a constr作者: Acumen 時(shí)間: 2025-3-23 09:03 作者: 制定法律 時(shí)間: 2025-3-23 09:45
On the Periods of Spatially Periodic Preimages in Linear Bipermutive Cellular Automata,how that when the CA is only bipermutive and . is a spatially periodic configuration of period ., the periods of all preimages of . are multiples of .. We then present a connection between preimages of spatially periodic configurations of LBCA and concatenated linear recurring sequences, finding a c作者: 同義聯(lián)想法 時(shí)間: 2025-3-23 16:40
Merging Cellular Automata Rules to Optimise a Solution to the Modulo-, Problem,uting by means of locally processing components. In this context, a solution has been recently proposed to the Modulo-. Problem, which is the determination of whether the number of 1-bits in a binary string is perfectly divisible by the positive integer .. Here, we show how to optimise that solution作者: ADAGE 時(shí)間: 2025-3-23 19:54 作者: gruelling 時(shí)間: 2025-3-24 01:58 作者: Collar 時(shí)間: 2025-3-24 02:54
Optimale Produktions- und Absatzplanunging problem for tag systems with only 2 symbols (the minimum possible) is proved undecidable. This result has already yielded applications including a significant improvement on previous undecidability bounds for the Post correspondence problem and the matrix mortality problem.作者: 邪惡的你 時(shí)間: 2025-3-24 09:02
Welfare Professions and the Lawuction is provided that enables real-time . to accept the reversal of real-time iterative array languages. Finally, restricted real-time . are investigated which are allowed to dissolve only a number of cells that is bounded by some function. In this case, an infinite strict hierarchy of language classes is obtained.作者: LEVER 時(shí)間: 2025-3-24 11:01 作者: Comprise 時(shí)間: 2025-3-24 15:26
Eigentümerkontrolle in der KGaAhat washes out finite islands in linear time classifies all Bernoulli random configurations with parameters close to . or . almost surely correctly. The proof is a direct application of a “percolation” argument which goes back to Gács (1986).作者: Emg827 時(shí)間: 2025-3-24 22:06
0302-9743 tems, AUTOMATA 2015, held in Turku, Finland, in June 2015. This volume contains 4 invited talks in full-paper length and 15 regular papers, which were carefully reviewed and selected from a total of 33 submissions. Topics of interest include, the following aspects and features of such systems: dynam作者: 外星人 時(shí)間: 2025-3-25 00:14 作者: narcotic 時(shí)間: 2025-3-25 06:28 作者: 甜食 時(shí)間: 2025-3-25 07:28
Classification of Elementary Cellular Automata Up to Topological Conjugacy, In particular we show how to compute the cardinality of the set of points with minimal period . for one-dimensional CA. Applying these methods to the 256 elementary one-dimensional CA, we show that up to topological conjugacy there are exactly 83 of them.作者: Anticoagulant 時(shí)間: 2025-3-25 11:47 作者: Pessary 時(shí)間: 2025-3-25 17:29 作者: Keratectomy 時(shí)間: 2025-3-25 21:00 作者: entrance 時(shí)間: 2025-3-26 01:08 作者: 好色 時(shí)間: 2025-3-26 08:05 作者: 露天歷史劇 時(shí)間: 2025-3-26 10:07 作者: heirloom 時(shí)間: 2025-3-26 15:10
L-Convex Polyominoes Are Recognizable in Real Time by 2D Cellular Automata,lyominoes that is similar to the one used for tiling systems, the real time constraint which has no equivalent in terms of tilings requires the use of techniques that are specific to cellular automata.作者: glomeruli 時(shí)間: 2025-3-26 19:16
On the Periods of Spatially Periodic Preimages in Linear Bipermutive Cellular Automata, of a single preimage of a spatially periodic configuration . of a given LBCA, and characterise the periods of all preimages of . when the corresponding characteristic polynomial is the product of two distinct irreducible polynomials.作者: 使人入神 時(shí)間: 2025-3-26 23:02 作者: Tempor 時(shí)間: 2025-3-27 04:11
https://doi.org/10.1007/978-3-322-83651-9luences the limit cycle structure of block-sequential systems. We derive a sufficient condition on the graph structure so that the system has only fixed points as limit cycles. We also identify several well-known graph families that satisfy this condition.作者: 天氣 時(shí)間: 2025-3-27 08:47 作者: INERT 時(shí)間: 2025-3-27 10:25
Effect of Graph Structure on the Limit Sets of Threshold Dynamical Systems,luences the limit cycle structure of block-sequential systems. We derive a sufficient condition on the graph structure so that the system has only fixed points as limit cycles. We also identify several well-known graph families that satisfy this condition.作者: 拱形大橋 時(shí)間: 2025-3-27 15:28 作者: 共同時(shí)代 時(shí)間: 2025-3-27 21:18 作者: 厭倦嗎你 時(shí)間: 2025-3-27 22:48
Shrinking One-Way Cellular Automata,uction is provided that enables real-time . to accept the reversal of real-time iterative array languages. Finally, restricted real-time . are investigated which are allowed to dissolve only a number of cells that is bounded by some function. In this case, an infinite strict hierarchy of language classes is obtained.作者: 裙帶關(guān)系 時(shí)間: 2025-3-28 05:04
Merging Cellular Automata Rules to Optimise a Solution to the Modulo-, Problem, in terms of a reduction of the number of rules required, by means of a . operation involving of the rules′ active state transitions. The potential for a more general usage of the merging operation is also addressed.作者: 時(shí)間等 時(shí)間: 2025-3-28 06:16 作者: chassis 時(shí)間: 2025-3-28 13:49
Conference proceedings 2015logical, ergodic and algebraic aspects; algorithmic and complexity issues; emergent properties; formal language processing aspects; symbolic dynamics; models of parallelism and distributed systems; timing schemes; phenomenological descriptions; scientific modeling; and practical applications.作者: curettage 時(shí)間: 2025-3-28 16:18 作者: 收集 時(shí)間: 2025-3-28 20:53 作者: 創(chuàng)造性 時(shí)間: 2025-3-29 00:28
Welfare Professions and the LawWe define, as local quantities, the least energy and momentum allowed by quantum mechanics and special relativity for physical realizations of some classical lattice dynamics. These definitions depend on local rates of finite-state change. In two example dynamics, we see that these rates evolve like classical mechanical energy and momentum.作者: Infuriate 時(shí)間: 2025-3-29 06:03 作者: 留戀 時(shí)間: 2025-3-29 09:22 作者: APO 時(shí)間: 2025-3-29 14:35 作者: 歡樂東方 時(shí)間: 2025-3-29 16:50
Groups and Monoids of Cellular Automata,We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal subshifts, countable subshifts and coded and synchronized systems. Both purely group-theoretic properties and issues of decidability are considered.作者: 享樂主義者 時(shí)間: 2025-3-29 23:08 作者: 健忘癥 時(shí)間: 2025-3-30 02:37
Group-Walking Automata,In the setting of symbolic dynamics on discrete finitely generated infinite groups, we define a model of multi-headed finite automata that walk on Cayley graphs, and use it to define subshifts. We characterize the torsion groups (also known as periodic groups) as those on which the group-walking automata are strictly weaker than Turing machines.作者: circuit 時(shí)間: 2025-3-30 07:52
Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata,A linear-slender context-free language is a context-free language whose number of words of length . is linear in .. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.作者: 使困惑 時(shí)間: 2025-3-30 10:47
Cellular Automata and Discrete Complex Systems978-3-662-47221-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Pert敏捷 時(shí)間: 2025-3-30 15:52
https://doi.org/10.1007/978-3-322-83651-9tions to be done directly on the cells. We discuss physical universality in general, the issues specific to the quantum setting, and give an example of a quantum cellular automaton achieving a quantum definition of physical universality.作者: bizarre 時(shí)間: 2025-3-30 19:46 作者: 不透明性 時(shí)間: 2025-3-30 21:43 作者: 確定的事 時(shí)間: 2025-3-31 01:50
A Physically Universal Quantum Cellular Automaton,tions to be done directly on the cells. We discuss physical universality in general, the issues specific to the quantum setting, and give an example of a quantum cellular automaton achieving a quantum definition of physical universality.作者: 使堅(jiān)硬 時(shí)間: 2025-3-31 05:31
Hard Core via PCA: Entropy Bounds,ncreasing sequence of lower bounds for the topological entropy. Additionally the procedure gives some insight on the support of the measure of maximal entropy. The method also applies to other lattices and models with appropriate sublattice splitting.作者: 形容詞 時(shí)間: 2025-3-31 09:28 作者: Soliloquy 時(shí)間: 2025-3-31 14:25 作者: ascend 時(shí)間: 2025-3-31 19:53 作者: 宮殿般 時(shí)間: 2025-3-31 22:11 作者: maudtin 時(shí)間: 2025-4-1 05:42 作者: 語源學(xué) 時(shí)間: 2025-4-1 09:53 作者: 貞潔 時(shí)間: 2025-4-1 11:38
https://doi.org/10.1007/978-3-322-83651-9s partitioned into blocks, and the blocks are updated sequentially while the vertices within each block are updated in parallel. There are several notable previous results concerning the two extreme cases of block-sequential update: (i)?sequential and (ii)?parallel. While parallel threshold systems 作者: Aura231 時(shí)間: 2025-4-1 15:39
Objektwandel in der Organisationsforschungcellular automaton. The game, known as ., consists of moving a queen as in chess, but always towards?(0,0), and it may not be moved to any of . temporarily “blocked” positions specified on the previous turn by the other player. The game ends when a player wins by blocking all possible moves of the o作者: indices 時(shí)間: 2025-4-1 21:10
https://doi.org/10.1007/978-3-322-83665-6ncreasing sequence of lower bounds for the topological entropy. Additionally the procedure gives some insight on the support of the measure of maximal entropy. The method also applies to other lattices and models with appropriate sublattice splitting.作者: 太空 時(shí)間: 2025-4-1 23:25 作者: 等待 時(shí)間: 2025-4-2 04:58
Objektwandel in der Organisationsforschunge study this inverse problem for one-dimensional binary systems with periodic boundary conditions (i.e., rings). For small neighbourhoods, we present results obtained with the formulation of the problem as a SAT problem and the use of SAT solvers. Our observations suggest that it is not possible to
