神圣将军
发表于 2025-3-26 23:20:04
http://reply.papertrans.cn/24/2321/232066/232066_31.png
MUMP
发表于 2025-3-27 04:07:01
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
发表于 2025-3-27 08:22:21
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
以烟熏消毒
发表于 2025-3-27 10:06:43
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
北极熊
发表于 2025-3-27 16:37:49
http://reply.papertrans.cn/24/2321/232066/232066_35.png
Flounder
发表于 2025-3-27 18:32:37
http://reply.papertrans.cn/24/2321/232066/232066_36.png
insincerity
发表于 2025-3-27 23:18:34
http://reply.papertrans.cn/24/2321/232066/232066_37.png
严峻考验
发表于 2025-3-28 03:36:28
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
发表于 2025-3-28 07:50:42
http://reply.papertrans.cn/24/2321/232066/232066_39.png
调整
发表于 2025-3-28 10:25:34
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