Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Bedard:1993:EBM,
author = "F. Bedard and F. Lemieux and P. McKenzie",
title = "Extensions to {Barrington}'s {M}-program model",
journal = j-THEOR-COMP-SCI,
volume = "107",
number = "1",
pages = "31--61",
day = "04",
month = jan,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:15:15 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. d'Inf. et Recherche Oper., Montreal Univ., Que.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity class; computational complexity;
DLOGTIME-reductions; groupoids; growing abelian monoid
sequences; LOGCFL; monoids; nonassociative structures;
polynomial-length program over a monoid; specific
languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}