找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Computation, Cooperation, and Life; Essays Dedicated to Jozef Kelemen,Alica Kelemenová Book 2011 The Editor(s) (if applicable) and The Aut

[復制鏈接]
查看: 9828|回復: 54
樓主
發(fā)表于 2025-3-21 17:10:55 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Computation, Cooperation, and Life
副標題Essays Dedicated to
編輯Jozef Kelemen,Alica Kelemenová
視頻videohttp://file.papertrans.cn/233/232066/232066.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Computation, Cooperation, and Life; Essays Dedicated to  Jozef Kelemen,Alica Kelemenová Book 2011 The Editor(s) (if applicable) and The Aut
描述Gheorghe P?un has played an important role within a wide range of disciplines, from the foundations of traditional computation theory and formal language theory to research gaining its inspiration from living nature. He has significantly contributed to the development of these diverse fields, initiating and pioneering some of them with remarkable imaginativeness and enthusiasm. Gheorghe P?un’s research focusses on systems inspired by structures and processes found in living systems, with the field of membrane computing or P systems being the most important of his initiatives. This Festschrift volume, published to honor Gheorghe P?un on the occasion of his 60.th. birthday,? includes 16 contributions by his students and collaborators. The research presented aims to gain a better understanding of what computation is, to find better models of computation, and to look for new computing devices 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
出版日期Book 2011
關鍵詞P-automata; P-systems; bio-inspired computing; computational complexity; discrete structures; membrane sy
版次1
doihttps://doi.org/10.1007/978-3-642-20000-7
isbn_softcover978-3-642-19999-8
isbn_ebook978-3-642-20000-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer-Verlag GmbH, DE
The information of publication is updating

書目名稱Computation, Cooperation, and Life影響因子(影響力)




書目名稱Computation, Cooperation, and Life影響因子(影響力)學科排名




書目名稱Computation, Cooperation, and Life網絡公開度




書目名稱Computation, Cooperation, and Life網絡公開度學科排名




書目名稱Computation, Cooperation, and Life被引頻次




書目名稱Computation, Cooperation, and Life被引頻次學科排名




書目名稱Computation, Cooperation, and Life年度引用




書目名稱Computation, Cooperation, and Life年度引用學科排名




書目名稱Computation, Cooperation, and Life讀者反饋




書目名稱Computation, Cooperation, and Life讀者反饋學科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 20:47:37 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:20:33 | 只看該作者
地板
發(fā)表于 2025-3-22 07:55:46 | 只看該作者
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.
5#
發(fā)表于 2025-3-22 10:08:03 | 只看該作者
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.
6#
發(fā)表于 2025-3-22 16:41:42 | 只看該作者
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.
7#
發(fā)表于 2025-3-22 17:39:37 | 只看該作者
8#
發(fā)表于 2025-3-22 22:59:09 | 只看該作者
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.
9#
發(fā)表于 2025-3-23 04:26:09 | 只看該作者
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.
10#
發(fā)表于 2025-3-23 07:38:58 | 只看該作者
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.
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-8 11:58
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
太保市| 长寿区| 祁连县| 临西县| 社会| 蓝山县| 凤阳县| 巴东县| 东莞市| 乐亭县| 昌平区| 家居| 青河县| 宜兰县| 乐亭县| 化隆| 宣威市| 莱州市| 望奎县| 道真| 云林县| 水富县| 长泰县| 兰州市| 南充市| 永清县| 达孜县| 宜君县| 光山县| 卓尼县| 云和县| 博野县| 内江市| 佳木斯市| 罗田县| 湛江市| 白河县| 佛坪县| 巴马| 汤阴县| 壤塘县|