Last update: Thu May 16 02:07:42 MDT 2019
@Article{Narendran:2000:TTU,
author = "Paliath Narendran and Michael Rusinowitch",
title = "The Theory of Total Unary {RPO} Is Decidable",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1861",
pages = "660--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:48 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1861/18610660.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1861/18610660.pdf",
acknowledgement = ack-nhfb,
}