- Alternative title
-
Ein Kompass zur kontrollierten Graphersetzung
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Darmstadt, Technische Universität Darmstadt, Dissertation, 2019
- Keyword
-
Compass
- Event
-
Veröffentlichung
- (where)
-
Darmstadt
- (who)
-
Universitäts- und Landesbibliothek Darmstadt
- (when)
-
2019
- Creator
- Contributor
- URN
-
urn:nbn:de:tuda-tuprints-93049
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.11.2025, 2:46 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kulcsár, Géza
- Schürr, Andy
- Corradini, Andrea
- Universitäts- und Landesbibliothek Darmstadt
Time of origin
- 2019
Other Objects (12)
Infinite graphs generated by tree rewriting
Efficient graph rewriting and its implementation
Infinite graphs generated by tree rewriting
On termination of single pushout graph rewriting
A term rewriting technique for decision graphs
Learning and Rewriting in Fuzzy Rule Graphs
Deriving bisimulation congruences in the DPO approach to graph rewriting. Long version
Minimality of derived rules in single pushout graph rewriting
Description and verification of mobile processes with graph rewriting techniques
Three papers on graph rewriting systems and their applications, [1].
Rewriting Academia
Graph rewriting systems, 2.. Three papers on theory, application, and implementation
Infinite graphs generated by tree rewriting
Efficient graph rewriting and its implementation
Infinite graphs generated by tree rewriting
On termination of single pushout graph rewriting
A term rewriting technique for decision graphs
Learning and Rewriting in Fuzzy Rule Graphs
Deriving bisimulation congruences in the DPO approach to graph rewriting. Long version
Minimality of derived rules in single pushout graph rewriting
Description and verification of mobile processes with graph rewriting techniques
Three papers on graph rewriting systems and their applications, [1].
Rewriting Academia
Graph rewriting systems, 2.. Three papers on theory, application, and implementation
Infinite graphs generated by tree rewriting
Efficient graph rewriting and its implementation
Infinite graphs generated by tree rewriting
On termination of single pushout graph rewriting
A term rewriting technique for decision graphs
Learning and Rewriting in Fuzzy Rule Graphs
Deriving bisimulation congruences in the DPO approach to graph rewriting. Long version
Minimality of derived rules in single pushout graph rewriting
Description and verification of mobile processes with graph rewriting techniques
Three papers on graph rewriting systems and their applications, [1].
Rewriting Academia