Titlebook: ;

Factual

https://doi.org/10.1007/978-1-349-22459-3opose a new algorithm that is a generalization of a similar algorithm originally developed for forward chaining production systems. The time complexity of the proposed method is not better than that of a naive solution, in the worst case. In the best case, however, a significant speedup can be achie

大暴雨

diabetes

exostosis

Cycle chain code picture languages,s by the requirement that certain subpictures must be cycles or elementary cycles. We investigate basic properties of context-free cycle and elementary cycle grammars with emphasis on the complexity of the recognition problem. In particular, it is shown that the description complexity is polynomial

弹药

https://doi.org/10.1007/978-1-4302-1127-3 NP-complete problem, even for binary trees. Therefore, we design layout graph grammars which guarantee polynomial time constructions of optimal layouts of graphs. This is achieved by the restriction to polynomial graph grammars and layout specifications, which can be computed efficiently by an attr

homeostasis

enhance

Panel discussion: The use of graph grammars in applications,

南极

Presentation of the , An Integrated and Incremental Project Support ENviroment,

tariff

Presentation of the , A text-oriented hybrid editor for PROgrammed Graph REwriting SyStems,

GEAR

Graph Grammars and Their Application to Computer Science