From Hyperedge Replacement Grammars to Decidable Hyperedge Replacement Games-Reference-Cited by-同舟云学术

From Hyperedge Replacement Grammars to Decidable Hyperedge Replacement Games

Published:2018 Issue: Volume: Page:463-478
ISSN:0302-9743
Container-title:Software Technologies: Applications and Foundations
language:
Short-container-title:

Author:

Peuser Christoph

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-04771-9_33

Reference16 articles.

1. Alabdullatif, M., Heckel, R.: Graph transformation games for negotiating features. In: Graph Computation Models (GCM 2016) (2016)

2. Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown-automata. In: Handbook of Formal Languages, vol. 1: Word Language Grammar, pp. 111–172. Berlin (1997)

3. Lecture Notes in Computer Science;P Baldan,2007

4. Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 95–162. World Scientific (1997)

5. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental theory of typed attributed graph transformation based on adhesive HLR categories. Fundamenta Informaticae 74(1), 31–61 (2006)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Infinite-state graph transformation systems under adverse conditions;it - Information Technology;2021-09-23

2. Membership Problem with Adjacency Matrix;Computación y Sistemas;2021-09-12

3. Modeling Adverse Conditions in the Framework of Graph Transformation Systems;Electronic Proceedings in Theoretical Computer Science;2020-12-03