Ehrig H., Kreowski H.-J. (eds.): Proc. 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532, Berlin: Springer Verlag (1990),  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for synthesizing or recognizing graph like data structures in biology, chemistry etc. and graph rewriting systems especially in the form of programmed graph rewriting systems [5, 49] are often used as visual and executable specifications of abstract data types or graph manipulating tools (cf. [8, 13, 14, 15]. Early attempts to define graph manipulation languages may be found in [38, 32] Currently, the multi paradigm language PROGRES is the latest and most expressive descendent of a whole family of application oriented graph rewriting languages [11, 12, 47] It is a partly diagrammatic, partly ....

Ehrig H., Kreowski H.-J. (eds.): Proc. 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532, Berlin: Springer Verlag (1990),

....for synthesizing or recognizing graph like data structures in biology, chemistry etc. and graph rewriting systems especially in the form of programmed graph rewriting systems [5, 49] are often used as visual and executable specifications of abstract data types or graph manipulating tools (cf. [8, 13, 14, 15]. Early attempts to define graph manipulation languages may be found in [38, 32] Currently, the multi paradigm language PROGRES is the latest and most expressive descendent of a whole family of application oriented graph rewriting languages [11, 12, 47] It is a partly diagrammatic, partly ....

Ehrig H., Nagl M., Rozenberg G., Rosenfeld A. (eds.): Proc. 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 291, Berlin: Springer Verlag (1986)

....for synthesizing or recognizing graph like data structures in biology, chemistry etc. and graph rewriting systems especially in the form of programmed graph rewriting systems [5, 49] are often used as visual and executable specifications of abstract data types or graph manipulating tools (cf. [8, 13, 14, 15]. Early attempts to define graph manipulation languages may be found in [38, 32] Currently, the multi paradigm language PROGRES is the latest and most expressive descendent of a whole family of application oriented graph rewriting languages [11, 12, 47] It is a partly diagrammatic, partly ....

Ehrig H., Nagl M., Rozenberg G. (eds.): Proc. 2nd Int. Workshop on Graph Grammars and Their Applications to Computer Science, LNCS 153, Berlin: Springer Verlag (1982)

....for synthesizing or recognizing graph like data structures in biology, chemistry etc. and graph rewriting systems especially in the form of programmed graph rewriting systems [5, 49] are often used as visual and executable specifications of abstract data types or graph manipulating tools (cf. [8, 13, 14, 15]. Early attempts to define graph manipulation languages may be found in [38, 32] Currently, the multi paradigm language PROGRES is the latest and most expressive descendent of a whole family of application oriented graph rewriting languages [11, 12, 47] It is a partly diagrammatic, partly ....

Claus V., Ehrig H., Rozenberg G. (eds.): Proc. Int. Workshop on Graph Grammars and Their Applications to Computer Science And Biology, LNCS 73, Berlin: Springer Verlag (1978)

....a finite set of productions, which are used to grow graphs or hypergraphs by repeated replacements of nodes or hyperedges. There are various types of graph grammars introduced so far in literature. They differ mainly in the form of the productions and in the embedding mechanisms, see, for example [Cou90, EKR91, Eng89]. However, the dual to generative devices is still missing. There is no systematic approach on recognizing devices for graph languages. There are no graph automata, which fit to the major classes of graph grammars. This is a gap in the theory of graph languages. Here we do a first step to fill ....

....consists of the set of all terminal labeled graphs derivable from the axiom. Such a graph grammar is linear, if the right hand side graphs have at most one nonterminal node. The theory of graph grammars and their languages has been explored in great detail and depth. We refer the reader to e.g. [Bra95, Cou90, EKR91, Eng89, EL89, Nag79, RW86]. In this paper we introduce graph automata. They continue the line of finite automata and tree automata. These machines operate on strings and trees. Graph automata work on connected labeled graphs. A graph automaton is a multihead automaton with a finite set of states and a finite set of ....

[Article contains additional citation context not shown here]

H. Ehrig, H.J. Kreowski, G. Rozenberg. Proc. 4. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532 (1991).

....using the PROGRES graph programming language ( NS 91, Sch 91a, Sch 91b, Zun 92, Zun 95] In [EMRS 96] pp. 37 38) an application of graphgrammars in an educational software engineering game is presented. For more examples of graph grammars applications the reader can refer to [CER 79, ENR 83, ENRR 87, EKR 91, CEER 96] One interesting feature of the graph grammar approach to data structures specification is that they allow to integrate the definition of static and dynamic aspects. For example, in a PROGRES specification we can define graph schemata (i.e. node and edge types, cardinality ....

H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.): Proc. 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 291, Springer-Verlag (1987).

....Zam 96] using the PROGRES graph programming language ( NS 91, Sch 91a, Sch 91b, Zun 92, Zun 95] In [EMRS 96] pp. 37 38) an application of graphgrammars in an educational software engineering game is presented. For more examples of graph grammars applications the reader can refer to [CER 79, ENR 83, ENRR 87, EKR 91, CEER 96] One interesting feature of the graph grammar approach to data structures specification is that they allow to integrate the definition of static and dynamic aspects. For example, in a PROGRES specification we can define graph schemata (i.e. node and edge types, ....

H. Ehrig, M. Nagl, G. Rozenberg (eds.): Proc. 2nd Int. Workshop on Graph Grammars and Their Application to Computer Science, Proceedings, LNCS 153, Springer-Verlag (1983).

....PROGRES graph programming language ( NS 91, Sch 91a, Sch 91b, Zun 92, Zun 95] In [EMRS 96] pp. 37 38) an application of graphgrammars in an educational software engineering game is presented. For more examples of graph grammars applications the reader can refer to [CER 79, ENR 83, ENRR 87, EKR 91, CEER 96] One interesting feature of the graph grammar approach to data structures specification is that they allow to integrate the definition of static and dynamic aspects. For example, in a PROGRES specification we can define graph schemata (i.e. node and edge types, cardinality constraints ....

H. Ehrig, H.-J. Kreowski, G. Rozenberg (eds.): Proc. 4th Int. Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 532, Springer Verlag (1991).

....All contributions are shortly described. Similarly to the COMPUGRAPH reports the annotated bibliography is structured according to the areas of COMPUGRAPH II. This annotated bibliography does not give an introduction to graph transformation. For this purpose the reader is referred to [CER79, ENRR87, EKR91, SE94] A previous bibliography of papers on graph grammars and graph transformation is given in [Nag80] This annotated bibliography is divided into three main chapters concerning foundations of graph transformation, concurrency concepts and graph transformation for specification and ....

H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors. 3rd Int. Workshop on Graph Grammars and their Application to Computer Science, LNCS 291. Springer Verlag, 1987.

No context found.

H. Ehrig, M. Nagl, and G. Rozenberg, editors. 2nd Int. Workshop on Graph Grammars and their Application to Computer Science, LNCS 153. Springer, 1983.

....graph programming language ( NS 91, Sch 91a, Sch 91b, Zun 92, Zun 95] In [EMRS 96] pp. 37 38) an application of graphgrammars in an educational software engineering game is presented. For more examples of graph grammars applications the reader can refer to [CER 79, ENR 83, ENRR 87, EKR 91, CEER 96] One interesting feature of the graph grammar approach to data structures specification is that they allow to integrate the definition of static and dynamic aspects. For example, in a PROGRES specification we can define graph schemata (i.e. node and edge types, cardinality constraints on edges) ....

J. Cuny, H. Ehrig, G. Engels, G. Rozenberg (eds.): Proc. 5th Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 1073, Springer Verlag (1996).

No context found.

Ehrig H., Kreowski H.-J. (eds.): Proc. 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532, Berlin: Springer Verlag (1990),

No context found.

Claus V., Ehrig H., Rozenberg G. (eds.): Proc. Int. Workshop on Graph Grammars and Their Applications to Computer Science And Biology, LNCS 73, Berlin: Springer Verlag (1978)

No context found.

Ehrig H., Kreowski H.-J., Rozenberg G. (eds.): Proc. 4th Int. Workshop on Graph-Grammars and Their Application to Computer Science; (published in) LNCS, Springer Verlag (1991)

No context found.

H. Ehrig, G. Engels, G. Rozenberg: Proc. 5th Int. Workshop on Graph Grammars and Their Application to Computer Science; LNCS 1017, Springer-Verlag, Berlin, 1995.

No context found.

H. Ehrig, H.-J. Kreowski (eds.): Proc. 4th Int. Workshop on Graph Grammars and Their Application to Computer Science; LNCS 532, Springer-Verlag, Berlin, 1990.

No context found.

H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.): Proc. 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science; LNCS 291, Springer-Verlag, Berlin, 1986.

No context found.

H. Ehrig, M. Nagl, G. Rozenberg (eds.): Proc. 2nd Int. Workshop on Graph Grammars and Their Application to Computer Science; LNCS 153, Springer-Verlag, Berlin, 1982.

No context found.

V. Claus, H. Ehrig, G. Rozenberg (eds.): Proc. Int. Workshop on Graph Grammars and Their Application to Computer Science and Biology; LNCS 73, Springer-Verlag, Berlin, 1978.

No context found.

Ehrig H., Kreowski H.-J., Rozenberg G. (Eds.): Proc. 4th Int. Workshop on Graph-Grammars and their Application to Computer Science; LNCS 532, Berlin, Springer-Verlag (1991)

No context found.

J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors. Proc. 5 th Int. Workshop on Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.

No context found.

J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors. Proc. 5 th Int. Workshop on Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.

No context found.

Ehrig H., Kreowski H.-J., Rozenberg G. (eds.): Proc. 4th Int. Workshop on Graph-Grammars and Their Application to Computer Science; (published in) LNCS, Springer Verlag (1991)

No context found.

Ehrig H., Kreowski H.-J., Rozenberg G.: Proc. 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532, Springer Verlag (1991)

No context found.

Claus V., Ehrig H., Rozenberg G.: Proc. Int. Workshop on Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, Springer Verlag (1979)

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC