{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T06:49:06Z","timestamp":1652510946846},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)90111-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"345-359","source":"Crossref","is-referenced-by-count":8,"title":["Weights for total division orderings on strings"],"prefix":"10.1016","volume":"135","author":[{"given":"E.A.","family":"Scott","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90111-2_BIB1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","article-title":"Termination of rewriting systems by polynomial interpretations and its implementation","volume":"9","author":"Cherifa","year":"1987","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(94)90111-2_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","article-title":"Thue systems as rewriting systems","volume":"3","author":"Book","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)90111-2_BIB3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(92)90105-5","article-title":"The Rationality of total division orderings","volume":"44","author":"Cohen","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90111-2_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewriting systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90111-2_BIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)90111-2_BIB6","series-title":"An Introduction To The Theory Of Numbers","author":"Hardy","year":"1979"},{"key":"10.1016\/0304-3975(94)90111-2_BIB7","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","article-title":"Ordering by divisibility in abstract algebras","volume":"2","author":"Higman","year":"1952","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0304-3975(94)90111-2_BIB8","series-title":"Computational Problems in Abstract Algebra","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(94)90111-2_BIB9","series-title":"Proceedings of the 19th Allerton House Conference On Communication, Control and Computing","first-page":"634","article-title":"Two implementations of the recursive path ordering on monadic terms","author":"Lescanne","year":"1981"},{"key":"10.1016\/0304-3975(94)90111-2_BIB10","article-title":"Combinatorics On Words","volume":"17","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(94)90111-2_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(90)90148-Q","article-title":"A note on division orderings on strings","volume":"36","author":"Martin","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90111-2_BIB12","series-title":"Technical Report CSD-TR-91-24","article-title":"On the diversity of division orderings on strings","author":"Martin","year":"1991"},{"key":"10.1016\/0304-3975(94)90111-2_BIB13","series-title":"The Proceedings of the 8th Annual IEEE conference on Logic in Computer Science, Montreal","first-page":"356","article-title":"The order types of termination orderings on terms, strings and multisets","author":"Martin","year":"1993"},{"key":"10.1016\/0304-3975(94)90111-2_BIB14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/MAHC.1984.10017","article-title":"An early proof by Alan Turing","volume":"6","author":"Morris","year":"1984","journal-title":"Ann. His. Comput."},{"key":"10.1016\/0304-3975(94)90111-2_BIB15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(84)90090-2","article-title":"Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group","volume":"33","author":"Otto","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90111-2_BIB16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01692068","article-title":"Finite canonical rewriting systems for congruences generated by concurrency relations","volume":"20","author":"Otto","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)90111-2_BIB17","series-title":"Words Languages and Combinatorics","first-page":"454","article-title":"On totally ordered free monoids","author":"Saito","year":"1992"},{"key":"10.1016\/0304-3975(94)90111-2_BIB18","series-title":"Technical Report TM-0087","article-title":"Knuth\u2014Bendix algorithm for Thue system based on kachninuki ordering","author":"Sakai","year":"1984"},{"key":"10.1016\/0304-3975(94)90111-2_BIB19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0747-7171(87)80002-0","article-title":"Verifying nilpotence","volume":"3","author":"Sims","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)90111-2_BIB20","series-title":"Computability","author":"Tourlakis","year":"1984"},{"key":"10.1016\/0304-3975(94)90111-2_BIB21","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. London Math. Soc. Ser. 2"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:59:14Z","timestamp":1555077554000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0304397594901112"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90111-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}