{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:20:03Z","timestamp":1649096403130},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540643012","type":"print"},{"value":"9783540697213","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052359","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:31:11Z","timestamp":1149658271000},"page":"32-46","source":"Crossref","is-referenced-by-count":12,"title":["Automatic monoids versus monoids with finite convergent presentations"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Sattler-Klein","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Madlener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"4_CR1","series-title":"Math. Sciences Research Institute Publ.","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-1-4613-9730-4_7","volume-title":"Algorithms and Classification in Combinatorial Group Theory","author":"J.M. Alonso","year":"1992","unstructured":"J.M. Alonso. Combings of groups. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classification in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 165\u2013178. Springer-Verlag, New York, 1992."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R.V. Book","year":"1982","unstructured":"R.V. Book. Confluent and other types of Thue systems. J. Association Computing Machinery, 29:171\u2013182, 1982.","journal-title":"J. Association Computing Machinery"},{"key":"4_CR3","first-page":"360","volume-title":"Lecture Notes in Computer Science 138","author":"R.V. Book","year":"1982","unstructured":"R.V. Book. The power of the Church-Rosser property in string-rewriting systems. In D.W. Loveland, editor, 6th Conference on Automated Deduction, Lecture Notes in Computer Science 138, pages 360\u2013368. Springer-Verlag, Berlin, 1982."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0304-3975(83)90005-1","volume":"24","author":"R.V. Book","year":"1983","unstructured":"R.V. Book. Decidable sentences of Church-Rosser congruences. Theoretical Computer Science, 24:301\u2013312, 1983.","journal-title":"Theoretical Computer Science"},{"key":"4_CR5","doi-asserted-by":"publisher","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"4_CR6","unstructured":"CM. Campbell, E.F. Robertson, N. Ruskuc, and R.M. Thomas. Automatic Semigroups. Technical Report No. 1997\/29, Department of Mathematics and Computer Science, University of Leicester, 1997."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jsco.1994.1039","volume":"18","author":"R. Cremanns","year":"1994","unstructured":"R. Cremanns and F. Otto. Finite derivation type implies the homological finiteness condition FP3. Journal of Symbolic Computation, 18:91\u2013112, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/jsco.1996.0046","volume":"22","author":"R. Cremanns","year":"1996","unstructured":"R. Cremanns and F. Otto. For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP3. Journal of Symbolic Computation, 22:155\u2013177, 1996.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"D.B.A. Epstein. Word Processing In Groups. Jones and Bartlett Publishers, 1992.","DOI":"10.1201\/9781439865699"},{"key":"4_CR10","series-title":"Math. Sciences Research Institute Publ.","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-1-4613-9730-4_9","volume-title":"Algorithms and Classification in Combinatorial Group Theory","author":"S.M. Gersten","year":"1992","unstructured":"S.M. Gersten. Dehn functions and l1-norms of finite presentations. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classification in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 195\u2013224. Springer-Verlag, New York, 1992."},{"key":"4_CR11","first-page":"207","volume-title":"Lecture Notes in Computer Science 174","author":"R.H. Gilman","year":"1984","unstructured":"R.H. Gilman. Computations with rational subsets of confluent groups. In J. Fitch, editor, Proc. EUROSAM 84, Lecture Notes in Computer Science 174, pages 207\u2013212. Springer-Verlag, Berlin, 1984."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.2307\/2944334","volume":"134","author":"S.M. Gersten","year":"1991","unstructured":"S.M. Gersten and H.B. Short. Rational subgroups of biautomatic groups. Annals of Mathematics, 134:125\u2013158, 1991.","journal-title":"Annals of Mathematics"},{"key":"4_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation Addison-Wesley, Reading, M.A., 1979."},{"key":"4_CR14","first-page":"145","volume-title":"Semigroups, Automata and Languages","author":"J.F.P. Hudson","year":"1996","unstructured":"J.F.P. Hudson. Regular rewrite systems and automatic structures. In J. Almeida, G.M.S. Gomes, and P.V. Silva, editors, Semigroups, Automata and Languages, pages 145\u2013152. World Scientific, Singapure, 1996."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0747-7171(85)80022-5","volume":"1","author":"K. Madlener","year":"1985","unstructured":"K. Madlener and F. Otto. Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. Journal of Symbolic Computation, 1:383\u2013418, 1985.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(93)90213-D","volume":"113","author":"K. Madlener","year":"1993","unstructured":"K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic string-rewriting systems. Theoretical Computer Science, 113:119\u2013165, 1993.","journal-title":"Theoretical Computer Science"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","volume":"25","author":"C. \u00f3'D\u00danlaing","year":"1983","unstructured":"C. \u00f3'D\u00danlaing. Infinite regular Thue systems. Theoretical Computer Science, 25:171\u2013192, 1983.","journal-title":"Theoretical Computer Science"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00268077","volume":"23","author":"F. Otto","year":"1986","unstructured":"F. Otto. On deciding whether a monoid is a free monoid or is a group. Acta Informatica, 23:99\u2013110, 1986.","journal-title":"Acta Informatica"},{"key":"4_CR19","first-page":"226","volume-title":"Advances in Algorithms, Languages and Complexity","author":"F. Otto","year":"1997","unstructured":"F. Otto and Y. Kobayashi. Properties of monoids that are presented by finite convergent string-rewriting systems \u2014 a survey. In D.Z. Du and K. Ko, editors, Advances in Algorithms, Languages and Complexity, pages 226\u2013266. Kluwer Academic Publ., Dordrecht, 1997."},{"key":"4_CR20","unstructured":"F. Otto and A. Sattler-Klein. Some remarks on finitely presented monoids with automatic structure. Mathematische Schriften Kassel No. 9\/97, Fachbereich Mathematik\/Informatik, Universit\u00e4t Kassel, 1997."},{"key":"4_CR21","first-page":"215","volume-title":"Geometric methods in combinatorial semigroup theory","author":"S.J. Pride","year":"1995","unstructured":"S.J. Pride. Geometric methods in combinatorial semigroup theory. In J. Fountain, editor, Proc. of Int. Conf. on Semigroups, Formal Languages, and Groups, pages 215\u2013232. Kluwer Academic Publ., Dordrecht, 1995."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(94)90175-9","volume":"131","author":"C.C. Squier","year":"1994","unstructured":"C.C. Squier, F. Otto, and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Computer Science, 131:271\u2013294, 1994.","journal-title":"Theoretical Computer Science"}],"container-title":["Rewriting Techniques and Applications","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:33:10Z","timestamp":1555655590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":22,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0052359","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1998]]}}}