Titlebook: ;

習(xí)慣

書目名稱Graph Transformations in Computer Science影響因子(影響力)




書目名稱Graph Transformations in Computer Science影響因子(影響力)學(xué)科排名




書目名稱Graph Transformations in Computer Science網(wǎng)絡(luò)公開度




書目名稱Graph Transformations in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Graph Transformations in Computer Science被引頻次




書目名稱Graph Transformations in Computer Science被引頻次學(xué)科排名




書目名稱Graph Transformations in Computer Science年度引用




書目名稱Graph Transformations in Computer Science年度引用學(xué)科排名




書目名稱Graph Transformations in Computer Science讀者反饋




書目名稱Graph Transformations in Computer Science讀者反饋學(xué)科排名

脾氣暴躁的人

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.

殖民地