Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Therien:1981:CFM,
author = "D. Therien",
title = "Classification of finite monoids: The language
approach",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "2",
pages = "195--208",
month = may,
year = "1981",
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/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "School of Computer Sci., McGill Univ., Montreal, Que.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; convergence variety; finite monoid",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}