Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammarts

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	ICGT (14. : 2021 : Online) Graph Transformation
1. Verfasser:	Drewes, Frank (VerfasserIn)
Weitere Verfasser:	Hoffmann, Berthold (VerfasserIn), Minas, Mark (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
A Generalized Concurrent Rule Construction for Double-Pushout Rewrnlting	2021	Kosiol, Jens
Graph Rewriting and Relabeling with PBPO*	2021	Overbeek, Roy
Powerful and NP-Complete: Hypergraph Lambek Grammars	2021	Pshenitsyn, Tikhon
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammarts	2021	Drewes, Frank
Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars	2021	Fesefeldt, Ira
Concurrency Theorems for Non-linear Rewriting Theories	2021	Behr, Nicolas
Incorrectness Logic for Graph Programs	2021	Poskitt, Christopher M.
Interval Probabilistic Timed Graph Transformation Systems	2021	Maximova, Maria
Verifying Graph Programs with Monadic Second-Order Logic	2021	Wulandari, Gia S.
On the Complexity of Simulating Probabilistic Timed Graph Transformation Systems	2021	Zöllner, Christian
Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching	2021	Barkowsky, Matthias
Nets with Mana: A Framework for Chemical Reaction Modelling	2021	Genovese, Fabrizio
Transformations of Reaction Systems Over Categories by Means of Epi-Mono Factorization and Functors	2021	Lye, Aaron
Evaluation Diversity for Graph Conditions	2021	Schneider, Sven
A Case Study on the Graph-Transformational Modeling and Analysis of Puzzles	2021	Kreowski, Hans-Jörg
GrapePress - A Computational Notebook for Graph Transformations	2021	Weber, Jens H.