[PDF][PDF] A Church-Rosser theorem for graph grammars
BK Rosen - ACM SIGACT News, 1975 - dl.acm.org
BK Rosen
ACM SIGACT News, 1975•dl.acm.orgSIGAC'~ NEWS 27 SUMMER 1975 treat without using the theorem, but that will still fit into a
paper primarily concerned with proving the theorem. Section 2 sketches the context of the
theorem. Section 3 states the theorem. This announcement presupposes the concepts of
graph, graph morphism, and pushout as discussed in [4], but a detailed knowledge of [4] or
[9] is not assumed. 2. CONTEXT The theorem actually deals with graphs together with"
labels"[4] or" colors"[9] assigned to nodes and arcs. The complexity caused by colorings will …
paper primarily concerned with proving the theorem. Section 2 sketches the context of the
theorem. Section 3 states the theorem. This announcement presupposes the concepts of
graph, graph morphism, and pushout as discussed in [4], but a detailed knowledge of [4] or
[9] is not assumed. 2. CONTEXT The theorem actually deals with graphs together with"
labels"[4] or" colors"[9] assigned to nodes and arcs. The complexity caused by colorings will …
SIGAC'~ NEWS 27 SUMMER 1975 treat without using the theorem, but that will still fit into a paper primarily concerned with proving the theorem. Section 2 sketches the context of the theorem. Section 3 states the theorem. This announcement presupposes the concepts of graph, graph morphism, and pushout as discussed in [4], but a detailed knowledge of [4] or [9] is not assumed.
2. CONTEXT The theorem actually deals with graphs together with" labels"[4] or" colors"[9] assigned to nodes and arcs. The complexity caused by colorings will be avoided here by considering graphs alone. For present purposes a production therefore consists of three graphs and two graph morphisms:
ACM Digital LibraryShowing the best result for this search. See all results