Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Kim:1993:SSE, author = "Changwook Kim and Dong Hoon Lee", title = "Separating $k$-separated {eNCE} graph languages", journal = j-THEOR-COMP-SCI, volume = "120", number = "2", pages = "247--259", day = "22", month = nov, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:43 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=120&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=120&issue=2&aid=1326", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Sch. of Comput. Sci., Oklahoma Univ., Norman, OK, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "boundary eNCE; eNCE; eNCE graph languages; formal languages; grammars; graph grammar; graph languages; k-separated", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }