{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:18Z","timestamp":1725663378622},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540172208"},{"type":"electronic","value":"9783540474210"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17220-3_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:15:20Z","timestamp":1330197320000},"page":"74-82","source":"Crossref","is-referenced-by-count":7,"title":["The word problem for finitely presented monoids and finite canonical rewriting systems"],"prefix":"10.1007","author":[{"given":"Craig","family":"Squier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00263767","volume":"9","author":"J. Avenhaus","year":"1977","unstructured":"J. Avenhaus, K. Madlener; Subrekursive Komplexitaet bei Gruppen; I. Gruppen mit vorgeschriebener Komplexitaet; Acta Informatica 9 (1977), 87\u2013104.","journal-title":"Acta Informatica"},{"unstructured":"G. Bauer; Zur Darstellung von Monoiden durch konfluente Regelsysteme; dissertation, Fachbereich Informatik, Universitaet Kaiserslautern, 1981.","key":"7_CR2"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(85)90160-4","volume":"40","author":"G. Bauer","year":"1985","unstructured":"G. Bauer; N-level rewriting system; Theoret. Comput. Science 40 (1985), 85\u201399.","journal-title":"Theoret. Comput. Science"},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF00271645","volume":"21","author":"G. Bauer","year":"1984","unstructured":"G. Bauer, F. Otto; Finite complete rewriting systems and the complexity of the word problem; Acta Informatica 21 (1984), 521\u2013540.","journal-title":"Acta Informatica"},{"unstructured":"R. Bieri; Homological dimension of discrete groups; Queen Mary College Mathematics Notes, London, 1976.","key":"7_CR5"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01214865","volume":"170","author":"R. Bieri","year":"1980","unstructured":"R. Bieri; A connection between the integral homology and the centre of a rational linear group; Math. Z. 170 (1980), 263\u2013266.","journal-title":"Math. Z."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-15976-2_3","volume":"202","author":"R. V. Book","year":"1985","unstructured":"R.V. Book; Thue systems as rewriting systems; in J.P. Jouannaud (ed.), Rewriting Techniques and Applications, Lecture Notes Comp. Science 202 (1985), 63\u201394.","journal-title":"Rewriting Techniques and Applications, Lecture Notes Comp. Science"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","volume":"19","author":"R. V. Book","year":"1982","unstructured":"R.V. Book, M. Jantzen, C. Wrathall; Monadic Thue systems; Theoret. Comput. Science 19 (1982), 231\u2013251.","journal-title":"Theoret. Comput. Science"},{"unstructured":"K.S. Brown; Finiteness properties of groups, preprint.","key":"7_CR9"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(86)90117-9","volume":"44","author":"V. Diekert","year":"1986","unstructured":"V. Diekert; Complete semi-Thue systems for abelian groups; Theoret. Comput. Science 44 (1986), 199\u2013208.","journal-title":"Theoret. Comput. Science"},{"key":"7_CR11","first-page":"1","volume":"4","author":"A. Grzegorczyk","year":"1953","unstructured":"A. Grzegorczyk; Some classes of recursive functions; Rozprawy Math. 4 (1953), 1\u201345.","journal-title":"Rozprawy Math."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(85)90018-3","volume":"21","author":"M. Jantzen","year":"1985","unstructured":"M. Jantzen; A note on a special one-rule semi-Thue system; Inf. Proc. Letters 21 (1985), 135\u2013140.","journal-title":"Inf. Proc. Letters"},{"unstructured":"M. Jantzen; Thue congruences and complete string rewriting systems; Habilitationsschrift; Fachbereich Informatik, Universitaet Hamburg, 1986.","key":"7_CR13"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","volume":"35","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, P. Narendran; A finite Thue system with decidable word problem and without equivalent finite canonical system; Theoret. Comput. Science 35 (1985), 337\u2013344.","journal-title":"Theoret. Comput. Science"},{"unstructured":"S. Kemmerich; Unendliche Reduktionssysteme; dissertation, Fachbereich Mathematik, TH Aachen, 1983.","key":"7_CR15"},{"key":"7_CR16","volume-title":"Canonical Forms in Finitely Presented Algebras","author":"Ph. LeChenadec","year":"1986","unstructured":"Ph. LeChenadec; Canonical Forms in Finitely Presented Algebras; Pitman, London, John Wiley & Sons,Inc., New York-Toronto, 1986."},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0747-7171(85)80022-5","volume":"1","author":"K. Madlener","year":"1985","unstructured":"K. Madlener,F. Otto; Pseudo-natural algorithms for the word problem for finitely presented monoids and groups; J. Symbolic Comput. 1 (1985), 383\u2013418.","journal-title":"J. Symbolic Comput."},{"doi-asserted-by":"crossref","unstructured":"K. Madlener, F. Otto; Pseudo-natural algorithms for finitely generated presentations of monoids and groups; J. Symbolic Comput., to appear.","key":"7_CR18","DOI":"10.1016\/S0747-7171(88)80034-8"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","volume":"25","author":"C. O'Dunlaing","year":"1983","unstructured":"C. O'Dunlaing; Infinite regular Thue systems; Theoret. Comput. Science 25 (1983), 171\u2013192.","journal-title":"Theoret. Comput. Science"},{"doi-asserted-by":"crossref","unstructured":"C.C. Squier; Word problems and a homological finiteness condition for monoids; J. Pure Appl. Algebra, to appear.","key":"7_CR20","DOI":"10.1016\/0022-4049(87)90129-0"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"541","DOI":"10.2307\/2373106","volume":"85","author":"J. R. Stallings","year":"1963","unstructured":"J.R. Stallings; A finitely presented group whose 3-dimensional integral homology is not finitely generated; American J. of Mathematics 85 (1963), 541\u2013543.","journal-title":"American J. of Mathematics"},{"unstructured":"K. Weihrauch; Teilklassen primitiv-rekursiver Wortfunktionen; Report No. 91, GMD Bonn, 1974.","key":"7_CR22"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17220-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:10:40Z","timestamp":1619557840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17220-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540172208","9783540474210"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-17220-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}