Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power-Reference-Cited by-同舟云学术

Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power

Published:2022 Issue: Volume: Page:3-19
ISSN:0302-9743
Container-title:Graph Transformation
language:
Short-container-title:

Author:

Drewes Frank^ORCID,Hoffmann Berthold^ORCID,Minas Mark^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-09843-7_1

Reference16 articles.

1. Berglund, M.: Analyzing and pumping hyperedge replacement formalisms in a common framework. In: Echahed, R., Plump, D. (eds.) Pre-Proceedings Tenth International Workshop on Graph Computation Models, GCM@STAF 2019, Eindhoven, The Netherlands, 17 July 2019, pp. 17–32 (2019)

2. Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, chap. 2, pp. 95–162. World Scientific, Singapore (1997)

3. Drewes, F., Hoffmann, B.: Contextual hyperedge replacement. Acta Informatica 52(6), 497–524 (2015). https://doi.org/10.1007/s00236-015-0223-4

4. Lecture Notes in Computer Science;F Drewes,2012

5. Lecture Notes in Computer Science;F Drewes,2015

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

1. On the power of local graph expansion grammars with and without additional restrictions;Theoretical Computer Science;2024-11

2. Parsing Unranked Tree Languages, Folded Once;Algorithms;2024-06-19

3. Transduction from trees to graphs through folding;Information and Computation;2023-12

4. Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies;Computational Linguistics;2023