標(biāo)題: Titlebook: ; [打印本頁] 作者: TIBIA 時間: 2025-3-21 20:07
書目名稱Graph-Grammars and Their Application to Computer Science影響因子(影響力)
書目名稱Graph-Grammars and Their Application to Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph-Grammars and Their Application to Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Grammars and Their Application to Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Grammars and Their Application to Computer Science被引頻次
書目名稱Graph-Grammars and Their Application to Computer Science被引頻次學(xué)科排名
書目名稱Graph-Grammars and Their Application to Computer Science年度引用
書目名稱Graph-Grammars and Their Application to Computer Science年度引用學(xué)科排名
書目名稱Graph-Grammars and Their Application to Computer Science讀者反饋
書目名稱Graph-Grammars and Their Application to Computer Science讀者反饋學(xué)科排名
作者: MAZE 時間: 2025-3-21 20:55 作者: 盡忠 時間: 2025-3-22 00:44 作者: Ondines-curse 時間: 2025-3-22 08:02
Software specification by graph grammars,ation engineering using graph grammars. This approach is influenced by the syntactical definition of the underlying programming language or module concept etc. to be supported but also by the idea of the user interface.作者: 不吉祥的女人 時間: 2025-3-22 11:03
Modern Concepts of Peripheral Nerve Repairthm is described which analyzes new patterns pursuing the same strategy as the inference algorithm..Some remarks about the possibilities of extending this approach to stochastic and/or programmed grammars are added..Finally some examples from an implementation of the graph grammar inference and analysis system are given.作者: MUMP 時間: 2025-3-22 16:05
Modern Concurrency on Apple Platformsite) number of rewriting rules, which model the synchronized evolution of adjacent system components. The (terminal) distributed systems derived within a given grammar represent the alternative deterministic, concurrent computations of a single nondeterministic system which is thus completely modeled by the grammar.作者: MUMP 時間: 2025-3-22 19:16 作者: NEX 時間: 2025-3-22 23:19 作者: 人造 時間: 2025-3-23 05:04 作者: PRO 時間: 2025-3-23 06:59
Chain code picture languages,ory point of view. The results presented are concerned with the basic Chomsky hierarchy of picture description languages, basic decision problems and the complexity of pictures..The study should result in a better insight into the mathematical structure of picture languages generated by string grammars from the Chomsky hierarchy.作者: 文件夾 時間: 2025-3-23 10:08
https://doi.org/10.1007/978-3-211-99196-1tri nets. Finally it is proposed to combine the new approach of Ugo Montanari for synchronization with the aspects of concurrency reviewed above to obtain a graph grammar based model for concurrent and distributed systems.作者: Congeal 時間: 2025-3-23 16:19
Aspects of concurrency in graph grammars,tri nets. Finally it is proposed to combine the new approach of Ugo Montanari for synchronization with the aspects of concurrency reviewed above to obtain a graph grammar based model for concurrent and distributed systems.作者: Bravado 時間: 2025-3-23 20:02
Grammatical inference of graph grammars for syntactic pattern recognition, of complex two or three-dimensional patterns with labelled nodes and edges is given..Then follows the definition of a special class of graph grammars with rules producing chain- and star-structured subgraphs..A constructive inference algorithm is developed which uses the knowledge contained in the 作者: 有權(quán)威 時間: 2025-3-23 22:22
Graph grammars for distributed systems, spatial and the temporal aspects of a real system through the relations of adjacency and causality. Terminal symbols represent the (deterministic, certain) past history of the system while nonterminal symbols model the (possibly nondeterministic, potential) future history of the system. The (contex作者: 嘲笑 時間: 2025-3-24 02:28 作者: microscopic 時間: 2025-3-24 09:11 作者: antenna 時間: 2025-3-24 11:28 作者: Hirsutism 時間: 2025-3-24 14:50 作者: Plaque 時間: 2025-3-24 20:50 作者: innate 時間: 2025-3-25 00:07 作者: Picks-Disease 時間: 2025-3-25 03:57
Parsing of graphs in linear time,nput graph into subgraphs according to the productions of a given graph grammar. This paper discusses conditions of parsing in linear time using the well-known Wirth/Weber precedence approach. A special graph grammar class satisfying these conditions as well as an appropriate linear time precedence 作者: 邊緣帶來墨水 時間: 2025-3-25 08:49
Generation of 3-dimensional plant bodies by double wall map and stereomap systems,h of 4, 5, or 6 (column (a)). The geometrical constraints given by the quantification of wall lengths according to the number of segments of which they are composed, lead in some cases to 3-dimensional plant bodies described by the cellular arrangement in their epidermis. All archetypes exhibit very作者: assent 時間: 2025-3-25 14:34
Chain code picture languages,nse that it represents a traversal of a picture where the interpretation of the symbols . is: . — go (and draw) one unit line to the left of the current point; ., and . are interpreted analogously with “l(fā)eft” replaced by “right”, “up”, and “down”, respectively. This is one of the chain codemodels..A作者: nostrum 時間: 2025-3-25 17:38 作者: 蜈蚣 時間: 2025-3-25 22:31
Software specification by graph grammars, intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to specific作者: 口訣法 時間: 2025-3-26 03:43
Modern Concepts of Peripheral Nerve Repair of complex two or three-dimensional patterns with labelled nodes and edges is given..Then follows the definition of a special class of graph grammars with rules producing chain- and star-structured subgraphs..A constructive inference algorithm is developed which uses the knowledge contained in the 作者: Gastric 時間: 2025-3-26 07:47 作者: 變色龍 時間: 2025-3-26 12:00
https://doi.org/10.1007/978-3-7091-0258-9oral patterns. In order to describe such patterns in cell layers, parallel map rewriting systems are introduced. Some of their properties are discussed and the drawing of the maps‘ geometric representations is implemented. A number of biologically motivated geometric rules for such drawings are pres作者: 檢查 時間: 2025-3-26 13:36 作者: 錯 時間: 2025-3-26 19:56 作者: 察覺 時間: 2025-3-26 21:24
https://doi.org/10.1007/3-540-28087-1t of attributes describing the shape, placement, etc. of the nodes and edges of the underlying graph. The formal handling of graphics is done by attributing the rules of graph grammars and by passing the attributes up and down the derivation tree of the graphic.作者: Maximizer 時間: 2025-3-27 04:57 作者: CT-angiography 時間: 2025-3-27 08:44
https://doi.org/10.1007/978-3-319-99686-8 and translations. In this paper graph grammars are used to specify, in a very general way, the evaluators which are generated from atgs. These graph grammars are correct with respect to the languages derived by atgs, and specify meaningful parsers and compilers if the atgs satisfy some weak conditi作者: condone 時間: 2025-3-27 10:33
Janet Stocks,Capitolina Díaz,Bj?rn Haller?dnput graph into subgraphs according to the productions of a given graph grammar. This paper discusses conditions of parsing in linear time using the well-known Wirth/Weber precedence approach. A special graph grammar class satisfying these conditions as well as an appropriate linear time precedence 作者: ROOF 時間: 2025-3-27 15:19 作者: Arthropathy 時間: 2025-3-27 19:02 作者: 截斷 時間: 2025-3-27 22:29
https://doi.org/10.1007/978-3-030-63115-4behavioral (data manipulation) aspects. Geometric objects such as polygons, line segments, and points may have different relations among each other (such as order, adjacency, connectivity) and can be represented in a uniform spatial data structure (structure graph). The dynamic behavior is defined b作者: 軍械庫 時間: 2025-3-28 06:07
https://doi.org/10.1007/978-3-642-57254-8 intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to specific作者: 靈敏 時間: 2025-3-28 08:35 作者: 祖先 時間: 2025-3-28 13:18
has to offer the other..In this paper we begin a study of what graph grammar theory can learn from the theory of the lambda calculus, by generalising a central argument of lambda calculus theory; the best-known proof of the Church-Rosser property for the lambda calculus. Applications to the lambda calculus and elsewhere are indicated.作者: Friction 時間: 2025-3-28 14:49 作者: 思想流動 時間: 2025-3-28 20:34
https://doi.org/10.1007/978-3-319-14732-1 This paper summarizes some recent results on graph languages generated by edge replacement. Especially, we show that our languages are fixed points of their productions (considered as equations) and that they can be generated by language operations (substitution and iteration) from finite graph languages.作者: 阻塞 時間: 2025-3-29 00:00 作者: Inculcate 時間: 2025-3-29 05:17 作者: BET 時間: 2025-3-29 09:36
Algorithms for the generation and drawing of maps representing cell clones,oral patterns. In order to describe such patterns in cell layers, parallel map rewriting systems are introduced. Some of their properties are discussed and the drawing of the maps‘ geometric representations is implemented. A number of biologically motivated geometric rules for such drawings are presented and compared.作者: ANA 時間: 2025-3-29 13:48
Church-Rosser properties for graph replacement systems with unique splitting, has to offer the other..In this paper we begin a study of what graph grammar theory can learn from the theory of the lambda calculus, by generalising a central argument of lambda calculus theory; the best-known proof of the Church-Rosser property for the lambda calculus. Applications to the lambda calculus and elsewhere are indicated.作者: Type-1-Diabetes 時間: 2025-3-29 16:42
Attributed graph grammars for graphics,t of attributes describing the shape, placement, etc. of the nodes and edges of the underlying graph. The formal handling of graphics is done by attributing the rules of graph grammars and by passing the attributes up and down the derivation tree of the graphic.作者: aneurysm 時間: 2025-3-29 22:43
On context-free graph languages generated by edge replacement, This paper summarizes some recent results on graph languages generated by edge replacement. Especially, we show that our languages are fixed points of their productions (considered as equations) and that they can be generated by language operations (substitution and iteration) from finite graph languages.作者: acrimony 時間: 2025-3-30 02:34 作者: ethereal 時間: 2025-3-30 08:08 作者: hermetic 時間: 2025-3-30 11:03 作者: 搖晃 時間: 2025-3-30 13:38
https://doi.org/10.1007/978-3-662-08799-2Attributed programmed graph grammars are introduced in this paper and their application to a particular problem in image understanding, the understanding of schematic drawings like circuit diagrams and flowcharts, is described.作者: BARK 時間: 2025-3-30 20:13
https://doi.org/10.1007/3-211-37835-9Formalisms based on graph transformations are used to specify data base applications. Starting from an informal description, two formal specifications — one query-oriented and the other update-oriented — are successively derived.作者: 大溝 時間: 2025-3-30 20:54 作者: 吃掉 時間: 2025-3-31 02:33
Specification of data bases through rewriting rules,Formalisms based on graph transformations are used to specify data base applications. Starting from an informal description, two formal specifications — one query-oriented and the other update-oriented — are successively derived.作者: 甜瓜 時間: 2025-3-31 06:14 作者: Hemodialysis 時間: 2025-3-31 10:35 作者: Fabric 時間: 2025-3-31 13:34 作者: MAUVE 時間: 2025-3-31 18:12
Graph-Grammars and Their Application to Computer Science作者: ALIBI 時間: 2025-4-1 00:56
https://doi.org/10.1057/978-1-137-52407-2ity, the upcoming constraints, given by the edge length specification, will very often lead to impossibilities, as not any more dimension is available. In this case, cells become either smaller or stop to divide. This is a typical case of division stop under geometrical constraint (cf. A. Paz, this 作者: 大溝 時間: 2025-4-1 05:07
