Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Ilie:1997:CCC,
author = "Lucian Ilie",
title = "On computational complexity of contextual languages",
journal = j-THEOR-COMP-SCI,
volume = "183",
number = "1",
pages = "33--44",
day = "30",
month = aug,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:07 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=183&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=183&issue=1&aid=2510",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4240C (Computational complexity); C6180N
(Natural language processing)",
corpsource = "Turku Centre for Comput. Sci., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; contextual languages;
crossed agreements; duplication; formal languages;
grammar; grammars; multiple agreements; natural
languages; superword",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}