標(biāo)題: Titlebook: Computation, Cooperation, and Life; Essays Dedicated to Jozef Kelemen,Alica Kelemenová Book 2011 The Editor(s) (if applicable) and The Aut [打印本頁(yè)] 作者: minutia 時(shí)間: 2025-3-21 17:10
書(shū)目名稱Computation, Cooperation, and Life影響因子(影響力)
書(shū)目名稱Computation, Cooperation, and Life影響因子(影響力)學(xué)科排名
書(shū)目名稱Computation, Cooperation, and Life網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Computation, Cooperation, and Life網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Computation, Cooperation, and Life被引頻次
書(shū)目名稱Computation, Cooperation, and Life被引頻次學(xué)科排名
書(shū)目名稱Computation, Cooperation, and Life年度引用
書(shū)目名稱Computation, Cooperation, and Life年度引用學(xué)科排名
書(shū)目名稱Computation, Cooperation, and Life讀者反饋
書(shū)目名稱Computation, Cooperation, and Life讀者反饋學(xué)科排名
作者: Neuralgia 時(shí)間: 2025-3-21 20:47 作者: Monotonous 時(shí)間: 2025-3-22 01:20 作者: TIA742 時(shí)間: 2025-3-22 07:55
On the Expressive Power of Valences in Cooperating Distributed Grammar Systemsge families. Interestingly, the underlying concepts had some anniversaries this year: Valence grammars were introduced 30 years ago, and the first paper that combined valences and CD grammar systems was published 20 years ago.作者: 縮影 時(shí)間: 2025-3-22 10:08
P Colonies and Their Extensions. P?colonies belong to the?family of?models of?membrane computing called P?systems. We show that P colonies with capacity three and two agents using homogeneous programs without checking rules are computationally complete as well as eco-P colonies with two agents and a passive environment and PCol automata working in init mode.作者: 眼界 時(shí)間: 2025-3-22 16:41
https://doi.org/10.37307/b.978-3-503-20007-8A recurrent formula enumerating unlabeled membrane structures is presented, which is deduced by means of elementary combinatorial arguments by considering them as hypermultisets built from the empty set.作者: 眼界 時(shí)間: 2025-3-22 17:39 作者: 反話 時(shí)間: 2025-3-22 22:59
Stromrichteranlagen der StarkstromtechnikThe paper investigates Watson-Crick D0L systems, mainly over the four-letter DNA alphabet. Results are obtained concerning stability versus Fibonacci numbers, as well as classes of growth functions that are not ?-rational.作者: Commemorate 時(shí)間: 2025-3-23 04:26
A Recurrent Enumeration of Free HypermultisetsA recurrent formula enumerating unlabeled membrane structures is presented, which is deduced by means of elementary combinatorial arguments by considering them as hypermultisets built from the empty set.作者: Conflagration 時(shí)間: 2025-3-23 07:38
Computing the Maximum Bisimulation with Spiking Neural P SystemsWe use spiking neural P systems to produce in linear time a partition of the nodes of a graph, which is coarser than the maximum bisimulation.作者: Bmd955 時(shí)間: 2025-3-23 11:32
On Some Biologically Motivated Control Devices for Parallel RewritingThe paper investigates Watson-Crick D0L systems, mainly over the four-letter DNA alphabet. Results are obtained concerning stability versus Fibonacci numbers, as well as classes of growth functions that are not ?-rational.作者: 很像弓] 時(shí)間: 2025-3-23 13:53 作者: 繁榮中國(guó) 時(shí)間: 2025-3-23 20:32 作者: 分開(kāi) 時(shí)間: 2025-3-23 23:14 作者: 雄偉 時(shí)間: 2025-3-24 02:46
H. Wiehn,H. Langner,H. SchusterVictor Mitrana), Dordrecht/Boston/London: Kluwer, 2001). At the beginning of the 21st century, his scientific achievements were already impressive in all respects: emergent topics, strong interaction with the international community of computer scientists, publications in prestigious journals and at作者: BOAST 時(shí)間: 2025-3-24 09:26 作者: 哄騙 時(shí)間: 2025-3-24 14:30 作者: Locale 時(shí)間: 2025-3-24 16:28
Hans Joachim K?lbel,Martin Schmei?erd, programmed, matrix, random context, and ordered grammars as well as some basic variants of grammar systems. Most of the general relations between graph-controlled grammars, matrix grammars, random-context grammars, and ordered grammars established in this paper are independent from the objects an作者: 逗留 時(shí)間: 2025-3-24 19:28
,PreussenElektras Kampf um Gr??e,nted variants of CD grammar systems where the component grammars indicate their confidence level in rewriting nonterminals. We provide representations of the recursively enumerable language class in terms of ciCD grammar systems with two types of derivations based on the confidence of the components作者: incredulity 時(shí)間: 2025-3-25 01:15 作者: 制定法律 時(shí)間: 2025-3-25 06:24
C. G. Mueller,S. Nayar,J. Campos,F. Baronege families. Interestingly, the underlying concepts had some anniversaries this year: Valence grammars were introduced 30 years ago, and the first paper that combined valences and CD grammar systems was published 20 years ago.作者: 萬(wàn)神殿 時(shí)間: 2025-3-25 09:19
https://doi.org/10.1007/978-3-319-78127-3red environment which is represented by a string. The environment is developing not only by the actions of the agents, but also as L systems using its developmental rules..In this chapter we deal with eco-colonies working in the weakly parallel derivation mode. We compare the generative power of wea作者: 沙發(fā) 時(shí)間: 2025-3-25 13:15 作者: 微枝末節(jié) 時(shí)間: 2025-3-25 17:31 作者: Asperity 時(shí)間: 2025-3-25 21:37
https://doi.org/10.1007/978-3-7091-9525-3. P?colonies belong to the?family of?models of?membrane computing called P?systems. We show that P colonies with capacity three and two agents using homogeneous programs without checking rules are computationally complete as well as eco-P colonies with two agents and a passive environment and PCol a作者: 孤獨(dú)無(wú)助 時(shí)間: 2025-3-26 00:49 作者: 邪惡的你 時(shí)間: 2025-3-26 04:39
Book 2011s inspired by the structure and/or functioning of natural or societal systems. The papers are preceded by an introduction by Solomon Marcus, Gheorghe P?un’s lifelong teacher and mentor, and are organized in topical sections on general computing, grammar systems, membrane systems, and inspirations fr作者: FADE 時(shí)間: 2025-3-26 09:24
0302-9743 Gheorghe P?un’s lifelong teacher and mentor, and are organized in topical sections on general computing, grammar systems, membrane systems, and inspirations fr978-3-642-19999-8978-3-642-20000-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 數(shù)量 時(shí)間: 2025-3-26 14:58
Introduction: Impact of GP’s Scientific WorkVictor Mitrana), Dordrecht/Boston/London: Kluwer, 2001). At the beginning of the 21st century, his scientific achievements were already impressive in all respects: emergent topics, strong interaction with the international community of computer scientists, publications in prestigious journals and at作者: habile 時(shí)間: 2025-3-26 18:40
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization knowledge help for finding a high-quality solution for a locally modified instance?.We briefly survey the known results about reoptimization and consider a generalization of the model where not only one optimal solution is given, but the set of . optimal solutions for an instance is available for f作者: 神圣將軍 時(shí)間: 2025-3-26 23:20 作者: MUMP 時(shí)間: 2025-3-27 04:07
A General Framework for Regulated Rewriting Based on the Applicability of Rulesd, programmed, matrix, random context, and ordered grammars as well as some basic variants of grammar systems. Most of the general relations between graph-controlled grammars, matrix grammars, random-context grammars, and ordered grammars established in this paper are independent from the objects an作者: RENIN 時(shí)間: 2025-3-27 08:22
CD Grammar Systems: Competence and Confidencented variants of CD grammar systems where the component grammars indicate their confidence level in rewriting nonterminals. We provide representations of the recursively enumerable language class in terms of ciCD grammar systems with two types of derivations based on the confidence of the components作者: 以煙熏消毒 時(shí)間: 2025-3-27 10:06
Cooperating Distributed Grammar Systems: Components with Nonincreasing Competenced the competence of their components does not increase during rewriting. A component of a CDGS is?.-competent on a sentential form if it can rewrite exactly?. different nonterminals appearing in that string. A CDGS with components that are nonincreasing in competence works in =.-competence mode of d作者: 北極熊 時(shí)間: 2025-3-27 16:37 作者: Flounder 時(shí)間: 2025-3-27 18:32 作者: insincerity 時(shí)間: 2025-3-27 23:18 作者: 嚴(yán)峻考驗(yàn) 時(shí)間: 2025-3-28 03:36
A Temporal Logic for Mutual Mobile Membranes with Objects on Surfaceh involved membranes agree on the movement by means of objects and co-objects placed on their surfaces: if a membrane has an object (e.g., .) on its surface, then the other membrane involved in a movement rule should have the corresponding co-object (e.g., .) on its surface. Temporal logic of action作者: recession 時(shí)間: 2025-3-28 07:50 作者: 調(diào)整 時(shí)間: 2025-3-28 10:25
On the Parallelizability of Languages Accepted by P?Automata way in membrane computing: dP systems, .. .(2), 238–250, (2010)). A language accepted by a P automaton is efficiently parallelizable if there exists a distributed P?automaton which accepts the same language and its computations only take some fraction of the computing time of the non-distributed va作者: TRACE 時(shí)間: 2025-3-28 17:18 作者: doxazosin 時(shí)間: 2025-3-28 21:51 作者: animated 時(shí)間: 2025-3-29 01:41
Context Insertionsistance between two words that measures the minimal number of context insertions in one of the words in order to obtain the other. Some properties of this distance, which is actually a semimetric, are investigated.作者: 弄皺 時(shí)間: 2025-3-29 05:13
A Temporal Logic for Mutual Mobile Membranes with Objects on Surfacein TLA+ which could be used for verification of certain properties of the systems of mutual mobile membranes with objects on surface, and illustrate the whole process by a simple specification and its execution.作者: 懶惰民族 時(shí)間: 2025-3-29 10:27 作者: tympanometry 時(shí)間: 2025-3-29 15:29
On the Parallelizability of Languages Accepted by P?Automatariant. We examine how one of the features of P?automata, namely the choice of the mapping which maps the sequence of multisets imported by the system to the symbols of the alphabet of the accepted language, influences the efficient parallelizability of the accepted languages.作者: abracadabra 時(shí)間: 2025-3-29 17:12 作者: DRILL 時(shí)間: 2025-3-29 20:09
H. Wiehn,H. Langner,H. Schusterr science journals and in many program committees of international scientific meetings etc. It was enough for a successful life. Unfortunately, many scientists, if they don’t stop, they begin to decline when they enter the fifties. How far is this situation from that of GP!作者: elucidate 時(shí)間: 2025-3-30 01:58
Hans Joachim K?lbel,Martin Schmei?erallowing sequences of rules to be applied. For example, graph-controlled grammars are always at least as powerful as programmed and matrix grammars. For the simulation of random context and ordered grammars by matrix and graph-controlled grammars, some specific requirements have to be fulfilled by the types of rules.作者: commute 時(shí)間: 2025-3-30 06:00
https://doi.org/10.1007/978-3-322-90526-0iction, and we relate the generative power of such CDGSs working either in a sequential or in a parallel manner and according to the aforementioned cooperation protocol, for various ., with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking.作者: forebear 時(shí)間: 2025-3-30 08:47
Introduction: Impact of GP’s Scientific Workr science journals and in many program committees of international scientific meetings etc. It was enough for a successful life. Unfortunately, many scientists, if they don’t stop, they begin to decline when they enter the fifties. How far is this situation from that of GP!作者: 管理員 時(shí)間: 2025-3-30 13:52 作者: 無(wú)關(guān)緊要 時(shí)間: 2025-3-30 16:44 作者: Popcorn 時(shí)間: 2025-3-31 00:44 作者: 勤勉 時(shí)間: 2025-3-31 02:13
https://doi.org/10.1007/978-3-7091-9525-3riant. We examine how one of the features of P?automata, namely the choice of the mapping which maps the sequence of multisets imported by the system to the symbols of the alphabet of the accepted language, influences the efficient parallelizability of the accepted languages.
