When can an equational simple graph be generated by hyperedge replacement?-Reference-Cited by-同舟云学术

When can an equational simple graph be generated by hyperedge replacement?

Published:1998 Issue: Volume: Page:543-552
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 1998
language:
Short-container-title:

Author:

Barthelmann Klaus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055804

Reference23 articles.

1. Adámek, J., Koubek, V.: Least Fixed Point of a Functor. J. Comput. System Sci. 19 (1979) 163–178

2. Barthelmann, K.: How to Construct a Hyperedge Replacement System for a Context-Free Set of Hypergraphs. Tech. Rep. 7, Universität Mainz, Institut für Informatik (1996). Submitted for publication

3. Barthelmann, K.: On Equational Simple Graphs. Tech. Rep. 9, Universität Mainz, Institut für Informatik (1997). Submitted for publication

4. Barthelmann, K.: When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?. Tech. Rep. 2, Universität Mainz, Institut für Informatik (1998)

5. Bauderon, M.: Infinite hypergraphs I. Basic properties. Theoret. Comput. Sci. 82 (1991) 177–214

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

1. Rewriting Higher-Order Stack Trees;Theory of Computing Systems;2017-05-02

2. Rewriting Higher-Order Stack Trees;Lecture Notes in Computer Science;2015

3. First-Order Logic with Reachability Predicates on Infinite Systems;LEIBNIZ INT PR INFOR;2010

4. The modular decomposition of countable graphs. Definition and construction in monadic second-order logic;Theoretical Computer Science;2008-03

5. Axiomatising Tree-Interpretable Structures;Theory of Computing Systems;2004-01-01