Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Danyi:1998:CSD,
author = "G. D{\'a}nyi and Z. F{\"u}l{\"o}p",
title = "Compositions with superlinear deterministic top-down
tree transformations",
journal = j-THEOR-COMP-SCI,
volume = "194",
number = "1--2",
pages = "57--85",
day = "10",
month = mar,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:39 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=194&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/194/1-2/2534.pdf",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4220 (Automata theory)",
conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA '95) (papers in summary form
only received)",
corpsource = "Dept. of Found. of Comput. Sci., Jozsef Attila Univ.,
Szeged, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; deterministic; homomorphism tree
transformations; incomparability; monoid; rewriting
systems; superlinear; top-down tree transformations;
tree data structures; tree transformations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}