Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Habel:1998:URN,
author = "A. Habel and D. Plump",
title = "Unification, rewriting, and narrowing on term graphs",
journal = j-THEOR-COMP-SCI,
volume = "194",
number = "1--2",
pages = "243--??",
day = "10",
month = mar,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed May 27 07:21:35 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics)",
conflocation = "Pisa, Italy; 28 Aug.-1 Sept. 1995",
conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA '95) (papers in summary form
only received)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph grammars; graph substitution; narrowing;
rewriting; rewriting systems; term graph narrowing;
term graphs; unification",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxnote = "Check page numbers: duplicate in adjacent entries",
}