標(biāo)題: Titlebook: Cellular Automata and Discrete Complex Systems; 23rd IFIP WG 1.5 Int Alberto Dennunzio,Enrico Formenti,Antonio E. Porre Conference proceedi [打印本頁] 作者: ACRO 時(shí)間: 2025-3-21 18:21
書目名稱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é)科排名
作者: flavonoids 時(shí)間: 2025-3-21 22:27 作者: 控制 時(shí)間: 2025-3-22 01:56 作者: Blemish 時(shí)間: 2025-3-22 07:22
https://doi.org/10.1007/978-3-322-85116-1 0’s and the set of length . strings avoiding . consecutive 0’s and 1’s with some more restriction on the first and last letter, via a simple bijection. In the special case . a probably new interpretation of Fibonacci numbers is given..Moreover, we describe in a combinatorial way the relation betwee作者: 單挑 時(shí)間: 2025-3-22 10:13 作者: Exhilarate 時(shí)間: 2025-3-22 15:00
https://doi.org/10.1007/978-3-322-85203-8aths. The resulting poset is called the .. We find closed formulas for the number of Schr?der words covering/covered by a given Schr?der word in terms of classical parameters of the associated Schr?der path. We also enumerate several classes of . (with respect to the length), i.e. sets of Schr?der w作者: Exhilarate 時(shí)間: 2025-3-22 17:37 作者: AMITY 時(shí)間: 2025-3-22 22:59
,Weitere Oberfl?chenschutzverfahren, equicontinuity and sensitivity to multivalued functions and investigate the characteristics of equicontinuous, almost equicontinuous and sensitive NCA. The dynamical behavior of nondeterministic CA in these classes is much less constrained than in the deterministic setting. In particular, we show t作者: DEMUR 時(shí)間: 2025-3-23 01:54 作者: Iatrogenic 時(shí)間: 2025-3-23 06:18
https://doi.org/10.1007/978-3-322-86004-0eezing non-strict majority rule, i.e., sites at state 1 remain unchanged and those at 0 change iff two or more of it neighbors are at state 1. We study the complexity of the decision problem consisting in?to decide whether an arbitrary site initially in state 0 will change to state 1. We show that t作者: 高原 時(shí)間: 2025-3-23 12:28 作者: generic 時(shí)間: 2025-3-23 15:26
Darstellung von Segmentierungsergebnissenme one-way cellular automata (.) are considered which are composed of reversible Mealy automata. Moreover, we differentiate between three notions of reversibility in the Mealy automata, namely, between weak and strong reversibility as well as reversible partitioned . which have been introduced by Mo作者: Overthrow 時(shí)間: 2025-3-23 20:56 作者: 褲子 時(shí)間: 2025-3-24 01:56
Objektorientierte Bildverarbeitungigate the possibility of using aperiodic tiling inside zones delimited by signals. More precisely, we study curves delineated by CA-constructible functions and prove that most of them can be filled with the NW-deterministic tile set defined by Kari?[.]. The achieved results also hint a new possible 作者: 膽汁 時(shí)間: 2025-3-24 03:27
Der Lebenszyklus offener Systeme,ystems. It is unknown, however, to what extent they are able to conduct computation. In this paper, we introduce the so-called ., which means that a cell’s update is insensitive to neighboring states that equal its own state. This property is stronger than the ., which signifies the existence of sta作者: DUST 時(shí)間: 2025-3-24 10:04 作者: 玷污 時(shí)間: 2025-3-24 10:51
https://doi.org/10.1007/978-3-322-85203-8aths. The resulting poset is called the .. We find closed formulas for the number of Schr?der words covering/covered by a given Schr?der word in terms of classical parameters of the associated Schr?der path. We also enumerate several classes of . (with respect to the length), i.e. sets of Schr?der words which do not contain a given Schr?der word.作者: G-spot 時(shí)間: 2025-3-24 16:00
Objektorientierte Bildverarbeitungilies comes from one-head machines, and allows us to build such automorphisms for the full shift, and to obtain undecidability results. We also give some conditions on the functions that can occur as such growths.作者: SKIFF 時(shí)間: 2025-3-24 21:53
Objektorientierte Bildverarbeitungigate the possibility of using aperiodic tiling inside zones delimited by signals. More precisely, we study curves delineated by CA-constructible functions and prove that most of them can be filled with the NW-deterministic tile set defined by Kari?[.]. The achieved results also hint a new possible way to study deterministic tile sets.作者: Flustered 時(shí)間: 2025-3-25 01:09 作者: addict 時(shí)間: 2025-3-25 04:54 作者: accrete 時(shí)間: 2025-3-25 11:06 作者: CYT 時(shí)間: 2025-3-25 15:22
https://doi.org/10.1007/978-3-322-86004-0We investigate some computational limits of trellis automata. Reusing a counting argument introduced in?[.], we show that: .is not a trellis language.作者: 固執(zhí)點(diǎn)好 時(shí)間: 2025-3-25 17:51
Some Computational Limits of Trellis AutomataWe investigate some computational limits of trellis automata. Reusing a counting argument introduced in?[.], we show that: .is not a trellis language.作者: CANDY 時(shí)間: 2025-3-25 21:17 作者: 偽造 時(shí)間: 2025-3-26 00:18 作者: DEMN 時(shí)間: 2025-3-26 08:21 作者: Binge-Drinking 時(shí)間: 2025-3-26 09:40
978-3-319-58630-4IFIP International Federation for Information Processing 2017作者: 無意 時(shí)間: 2025-3-26 14:47 作者: Fatten 時(shí)間: 2025-3-26 17:41
Infinite Two-Dimensional Strong Prefix Codes: Characterization and Propertiespictures in .. It is in general undecidable whether a set of pictures is a code, even in the finite case. Recently, finite strong prefix codes were introduced in [.] as a family of decidable picture codes. In this paper we study infinite strong prefix codes and give a characterization for the maxima作者: 有抱負(fù)者 時(shí)間: 2025-3-26 21:26
Restricted Binary Strings and Generalized Fibonacci Numbers 0’s and the set of length . strings avoiding . consecutive 0’s and 1’s with some more restriction on the first and last letter, via a simple bijection. In the special case . a probably new interpretation of Fibonacci numbers is given..Moreover, we describe in a combinatorial way the relation betwee作者: ENACT 時(shí)間: 2025-3-27 03:08
Von Neumann Regular Cellular Automatafunction. Let . be the monoid of all CA over .. In this paper, we investigate a generalisation of the inverse of a CA from the semigroup-theoretic perspective. An element . is . (or simply .) if there exists . such that . and ., where . is the composition of functions. Such an element . is called a 作者: 嬰兒 時(shí)間: 2025-3-27 05:47 作者: 蠟燭 時(shí)間: 2025-3-27 13:22 作者: Semblance 時(shí)間: 2025-3-27 16:48
Equicontinuity and Sensitivity of Nondeterministic Cellular Automata equicontinuity and sensitivity to multivalued functions and investigate the characteristics of equicontinuous, almost equicontinuous and sensitive NCA. The dynamical behavior of nondeterministic CA in these classes is much less constrained than in the deterministic setting. In particular, we show t作者: Infect 時(shí)間: 2025-3-27 21:28
Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rulesutomata. We use numerical simulations to study the mixtures obtained with three blind rules: the null rule, the identity rule and the inversion rule. As the mathematical analysis of such systems is a difficult task, we use numerical simulations to get insights into the dynamics of this class of stoc作者: OTTER 時(shí)間: 2025-3-27 23:39 作者: PANT 時(shí)間: 2025-3-28 03:01
Distortion in One-Head Machines and Cellular Automatailies comes from one-head machines, and allows us to build such automorphisms for the full shift, and to obtain undecidability results. We also give some conditions on the functions that can occur as such growths.作者: Intrepid 時(shí)間: 2025-3-28 08:29
Fast One-Way Cellular Automata with?Reversible Mealy Cellsme one-way cellular automata (.) are considered which are composed of reversible Mealy automata. Moreover, we differentiate between three notions of reversibility in the Mealy automata, namely, between weak and strong reversibility as well as reversible partitioned . which have been introduced by Mo作者: HEW 時(shí)間: 2025-3-28 10:29
Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automataady been settled for bipermutive CA with linear local rules, we address the general case of nonlinear rules, which could be interesting for cryptographic applications such as the design of cheater-immune secret sharing schemes. We first prove that two bipermutive CA generating orthogonal Latin squar作者: 意外的成功 時(shí)間: 2025-3-28 18:16
Filling Curves Constructed in Cellular Automata with Aperiodic Tilingigate the possibility of using aperiodic tiling inside zones delimited by signals. More precisely, we study curves delineated by CA-constructible functions and prove that most of them can be filled with the NW-deterministic tile set defined by Kari?[.]. The achieved results also hint a new possible 作者: 衰老 時(shí)間: 2025-3-28 22:12
Turing-Completeness of Asynchronous Non-camouflage Cellular Automataystems. It is unknown, however, to what extent they are able to conduct computation. In this paper, we introduce the so-called ., which means that a cell’s update is insensitive to neighboring states that equal its own state. This property is stronger than the ., which signifies the existence of sta作者: backdrop 時(shí)間: 2025-3-29 01:22 作者: 排出 時(shí)間: 2025-3-29 05:26 作者: 自傳 時(shí)間: 2025-3-29 08:44
Conference proceedings 2017operties; formal languages; symbolic dynamics; tilings; models of parallelism and distributed systems; timing schemes; synchronous versus asynchronous models; phenomenological descriptions; scientific modelling; practical applications...?.作者: ALLAY 時(shí)間: 2025-3-29 12:45
Objektorientierte Bildverarbeitunges must have pairwise balanced local rules. Then, we count the number of pairwise balanced bipermutive Boolean functions and enumerate those which generate orthogonal Latin squares up to . variables, classifying them with respect to their nonlinearity values.作者: 背帶 時(shí)間: 2025-3-29 17:26
https://doi.org/10.1007/978-3-322-85116-1regular elements in . when . and . are both finite. Furthermore, we study regular linear CA when . is a vector space over a field .; in particular, we show that every regular linear CA is invertible when . is torsion-free (e.g. when .), and that every linear CA is regular when . is finite-dimensional and . is locally finite with . for all ..作者: 悠然 時(shí)間: 2025-3-29 20:22
Darstellung von Segmentierungsergebnissen whereas the remaining two notions seem to be weaker. However, a non-semilinear language is provided that can be accepted by a real-time . with strongly reversible cells. On the other hand, we present a context-free, non-regular language that is accepted by some real-time reversible partitioned ..作者: SLING 時(shí)間: 2025-3-30 03:46 作者: FLOUR 時(shí)間: 2025-3-30 06:52
Von Neumann Regular Cellular Automataregular elements in . when . and . are both finite. Furthermore, we study regular linear CA when . is a vector space over a field .; in particular, we show that every regular linear CA is invertible when . is torsion-free (e.g. when .), and that every linear CA is regular when . is finite-dimensional and . is locally finite with . for all ..作者: 染色體 時(shí)間: 2025-3-30 10:19 作者: 變化 時(shí)間: 2025-3-30 13:44 作者: white-matter 時(shí)間: 2025-3-30 18:57 作者: OCTO 時(shí)間: 2025-3-30 23:20
