设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet C (Ca, Cb,Cc, Cd, Ce…... )

123456下一页
返回列表

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

[复制链接]
查看: 9800|回复: 54
发表于 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 人参与投票
1.jpg
 

0票 0.00%

Perfect with Aesthetics
2.jpg
 

1票 100.00%

Better Implies Difficulty
3.jpg
 

0票 0.00%

Good and Satisfactory
4.jpg
 

0票 0.00%

Adverse Performance
5.jpg
 

0票 0.00%

Disdainful Garbage
您所在的用户组没有投票权限
minutia
回复

举报

发表于 2025-3-21 20:47:37 | 显示全部楼层
Neuralgia
回复

举报

发表于 2025-3-22 01:20:33 | 显示全部楼层
Monotonous
回复

举报

发表于 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.
TIA742
回复

举报

发表于 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.
缩影
回复

举报

发表于 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.
眼界
回复

举报

发表于 2025-3-22 17:39:37 | 显示全部楼层
眼界
回复

举报

发表于 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.
反话
回复

举报

发表于 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.
Commemorate
回复

举报

发表于 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.
Conflagration
回复

举报

下一页 »
123456下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-29 21:46
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表