Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Ginsburg:1976:SUE,
author = "S. Ginsburg and J. Goldstine and S. Greibach",
title = "Some uniformly erasable families of languages",
journal = j-THEOR-COMP-SCI,
volume = "2",
number = "1",
pages = "29--44",
month = jun,
year = "1976",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Computer Sci. Program, Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "AFA; automata theory; context-free languages; finite
automata; homomorphism; languages; one counter
languages; one letter languages; uniformly erasable",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}