Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Metivier:1985:CLR,
author = "Y. Metivier",
title = "Calculation of the length of rewriting chains in free
monoide",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "71--87",
month = jan,
year = "1985",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "UER de Math. et Inf., Bordeaux Univ., Talence,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity measure; computational complexity; free
monoide; rewriting chains",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}