Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Engelfriet:1988:NBN,
author = "Joost Engelfriet and George Leih",
title = "Nonterminal bounded {NLC} graph grammars",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "309--315",
month = aug,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Leiden",
affiliationaddress = "Leiden, Neth",
classification = "721; C1160 (Combinatorial mathematics); C4210
(Formal logic)",
corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; formal languages; Grammars; grammars;
graph languages; graph theory; linear graph grammar;
nce Graph Grammars; neighbourhood controlled embedding;
nlc Graph Grammars; node label controlled graph
grammars; nonterminal bounded; Nonterminal Bounded
Grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}