{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:43:46Z","timestamp":1758278626388},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf00279954","type":"journal-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:23:30Z","timestamp":1688487810000},"page":"573-591","source":"Crossref","is-referenced-by-count":9,"title":["Elements of finite order for finite weight-reducing and confluent thue systems"],"prefix":"10.1007","volume":"25","author":[{"given":"Paliath","family":"Narendran","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00279954_CR1","unstructured":"Berstel, J.: Congruences plus que parfaites et langages algebriques; Seminaire d'Informatique Theorique; Institut de Programmation 1976\u201377, pp. 123\u2013147"},{"key":"BF00279954_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R.V. Book","year":"1982","unstructured":"Book, R.V.: Confluent and other types of Thue systems. J. Assoc. Comput. Mach. 29, 171\u2013182 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00279954_CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(82)90072-X","volume":"18","author":"R.V. Book","year":"1982","unstructured":"Book, R.V.: When is a monoid a group? The Church-Rosser case is tractable. Theor. Comput. Science 18, 325\u2013331 (1982)","journal-title":"Theor. Comput. Science"},{"key":"BF00279954_CR4","first-page":"1","volume-title":"Combinatorics on words: progress and perspectives","author":"R.V. Book","year":"1983","unstructured":"Book, R.V.: Thue systems and the Church-Rosser property: replacement systems, specification of formal languages, and presentations of monoids. In: Cummings, L. (ed.) Combinatorics on words: progress and perspectives, pp. 1\u201338. Don Mills, Ontario: Academic Press (Canada) 1983"},{"key":"BF00279954_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","volume":"3","author":"R.V. Book","year":"1987","unstructured":"Book, R.V.: Thue systems as rewriting systems. J. Symbolic Comput. 3, 39\u201368 (1987)","journal-title":"J. Symbolic Comput."},{"key":"BF00279954_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02771689","volume":"9","author":"Y. Cochet","year":"1971","unstructured":"Cochet, Y., Nivat, M.: Une generalization des ensembles de Dyck. Isr. J. Math. 9, 389\u2013395 (1971)","journal-title":"Isr. J. Math."},{"key":"BF00279954_CR7","series-title":"Lect. Notes Comput. Sci., vol. 247","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/BFb0039612","volume-title":"Proceedings of the 4th Symposium on Theoretical Aspects of Computer Science, Passau.","author":"V. Diekert","year":"1987","unstructured":"Diekert, V.: Some remarks on Church-Rosser Thue presentations. In: Proceedings of the 4th Symposium on Theoretical Aspects of Computer Science, Passau. (Lect. Notes Comput. Sci., vol. 247, pp. 272\u2013285). Berlin Heidelberg New York: Springer 1987"},{"key":"BF00279954_CR8","unstructured":"Diekert, V.: Some properties of weight-reducing presentations; Technical Report TUM-18710, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen (1987)"},{"key":"BF00279954_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01388581","volume":"81","author":"M.J. Dunwoody","year":"1985","unstructured":"Dunwoody, M.J.: The accessibility of finitely presented groups. Invent. Math. 81, 449\u2013457 (1985)","journal-title":"Invent. Math."},{"key":"BF00279954_CR10","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1137\/0214073","volume":"14","author":"D. Kapur","year":"1985","unstructured":"Kapur, D., Narendran, P.: The Knuth-Bendix completion procedure and Thue systems. SIAM J. Comput. 14, 1052\u20131072 (1985)","journal-title":"SIAM J. Comput."},{"key":"BF00279954_CR11","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0021-8693(74)90146-X","volume":"32","author":"G. Lallement","year":"1974","unstructured":"Lallement, G.: On monoids presented by a single relation. J. Algebra 32, 370\u2013388 (1974)","journal-title":"J. Algebra"},{"key":"BF00279954_CR12","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"Lallement, G.: Semigroups and Combinatorial Applications. New York Chichester Brisbane Toronto: John Wiley & Sons 1979"},{"key":"BF00279954_CR13","volume-title":"Combinatorial group theory","author":"R.C. Lyndon","year":"1977","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial group theory. Berlin Heidelberg New York: Springer 1977"},{"key":"BF00279954_CR14","series-title":"Lect. Notes Comput. Sci., vol. 256","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-17220-3_12","volume-title":"Rewriting techniques and applications","author":"K. Madiener","year":"1987","unstructured":"Madiener, K., Otto, F.: Groups presented by certain classes of finite length-reducing string-rewriting systems. In: Lescanne, P. (ed.). Rewriting techniques and applications. (Lect. Notes Comput. Sci., vol. 256, pp. 133\u2013144). Berlin Heidelberg New York: Springer 1987"},{"key":"BF00279954_CR15","unstructured":"Madlener, K., Otto, F.: On groups having finite monadic Church-Rosser presentations. In: Proceedings of the Oberwolfach Conference on Semigroups, 1986 (to appear)"},{"key":"BF00279954_CR16","volume-title":"Combinatorial group theory","author":"W. Magnus","year":"1976","unstructured":"Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory. 2nd revised Edn. New York: Dover 1976","edition":"2nd revised Edn"},{"key":"BF00279954_CR17","first-page":"953","volume":"77","author":"A. Markov","year":"1951","unstructured":"Markov, A.: Impossibility of algorithms for recognizing some properties of associative systems. Dokl. Akad. Nauk SSSR 77, 953\u2013956 (1951)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"BF00279954_CR18","series-title":"Lect. Notes Comput. Sci., vol. 256","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-17220-3_4","volume-title":"Rewriting techniques and applications","author":"U. Martin","year":"1987","unstructured":"Martin, U.: How to choose the weights in the Knuth-Bendix ordering. In: Lescanne, P. (ed.). Rewriting techniques and applications. (Lect. Notes Comput. Sci., vol. 256, pp. 42\u201353). Berlin Heidelberg New York: Springer 1987"},{"key":"#cr-split#-BF00279954_CR19.1","unstructured":"Mostowski, A.: Review of [17] Impossibility of algorithms for recognizing some properties of associative systems. Dokl. Akad. Nauk SSSR 77, 953-956 (1951)"},{"key":"#cr-split#-BF00279954_CR19.2","doi-asserted-by":"crossref","unstructured":"J. Symbolic Logic 17, 151-152 (1952)","DOI":"10.2307\/2266280"},{"key":"BF00279954_CR20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","volume":"26","author":"D.E. Muller","year":"1983","unstructured":"Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. J. Comput. System Sci. 26, 295\u2013310 (1983)","journal-title":"J. Comput. System Sci."},{"key":"BF00279954_CR21","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/S0019-9958(84)80041-8","volume":"63","author":"P. Narendran","year":"1984","unstructured":"Narendran, P., Otto, F., Winklmann, K.: The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete. Inf. Control 63, 58\u201366 (1984)","journal-title":"Inf. Control"},{"key":"BF00279954_CR22","volume-title":"Congruences parfaites et quasi-parfaites; Seminaire Dubreil, 25e Annee, 1971\u201372, Algebre","author":"M. Nivat","year":"1973","unstructured":"Nivat, M., (with Benois, M.): Congruences parfaites et quasi-parfaites; Seminaire Dubreil, 25e Annee, 1971\u201372, Algebre, Fasc. 1, Exp. No. 7, 9pp., Secretariat Mathematique, Paris, 1973"},{"key":"BF00279954_CR23","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1090\/S0002-9947-1985-0800255-1","volume":"291","author":"F. Otto","year":"1985","unstructured":"Otto, F.: Elements of finite order for finite monadic Church-Rosser Thue systems. Trans. Am. Math. Soc. 291, 629\u2013637 (1985)","journal-title":"Trans. Am. Math. Soc."},{"key":"BF00279954_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00268077","volume":"23","author":"F. Otto","year":"1986","unstructured":"Otto, F.: On deciding whether a monoid is a free monoid or is a group. Acta Informatica 23, 99\u2013110 (1986)","journal-title":"Acta Informatica"},{"key":"BF00279954_CR25","unstructured":"Zhang, L.X.: An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group. Theor. Comput. Sci. (to appear)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00279954.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00279954\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00279954.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:23:48Z","timestamp":1688487828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00279954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF00279954"],"URL":"https:\/\/doi.org\/10.1007\/bf00279954","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}