Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Head:1987:BDL,
author = "T. Head and B. Lando",
title = "Bounded {DL} languages",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "255--264",
month = "????",
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math. Sci., Alaska Univ., Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded language; computability; computational
complexity; D0L language; decidability; formal
languages; periodic D0L languages; polynomially
bounded",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}