Titlebook: ;

习惯

书目名称Graph Transformations in Computer Science影响因子(影响力)




书目名称Graph Transformations in Computer Science影响因子(影响力)学科排名




书目名称Graph Transformations in Computer Science网络公开度




书目名称Graph Transformations in Computer Science网络公开度学科排名




书目名称Graph Transformations in Computer Science被引频次




书目名称Graph Transformations in Computer Science被引频次学科排名




书目名称Graph Transformations in Computer Science年度引用




书目名称Graph Transformations in Computer Science年度引用学科排名




书目名称Graph Transformations in Computer Science读者反馈




书目名称Graph Transformations in Computer Science读者反馈学科排名

脾气暴躁的人

https://doi.org/10.1007/978-3-658-43265-2 local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express a large and natural class of generic graph functions.

Fracture

https://doi.org/10.1007/978-3-531-92287-4 underlying categories of HLR-systems. These results are specialized to graphs, hypergraphs, Petri nets, algebraic specifications and others by classifying the underlying categories with respect to the assumptions. This leads to interesting new results for most of the corresponding HLR-systems.

带子

Canonical derivations for high-level replacement systems, underlying categories of HLR-systems. These results are specialized to graphs, hypergraphs, Petri nets, algebraic specifications and others by classifying the underlying categories with respect to the assumptions. This leads to interesting new results for most of the corresponding HLR-systems.

Intruder

https://doi.org/10.1007/978-3-663-05992-9SPACE complete for arbitrary formulas. Moreover, the method works for these logics extended with operators for distributed and common knowledge, which otherwise cause a complexity increase to exponential time for the satisfiability problem.

随意

Decomposability helps for deciding logics of knowledge and belief,SPACE complete for arbitrary formulas. Moreover, the method works for these logics extended with operators for distributed and common knowledge, which otherwise cause a complexity increase to exponential time for the satisfiability problem.

随意

LUCY

A computational model for generic graph functions, local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express a large and natural class of generic graph functions.

Leaven

https://doi.org/10.1007/978-3-658-12810-4f the first and second systems, while the relationship between the second and the third one is sketched. The last system provides an abstract description of the compiled code of the LANAM, which is outlined.

殖民地