{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:50Z","timestamp":1725663290308},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159766"},{"type":"electronic","value":"9783540396796"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15976-2_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:26:27Z","timestamp":1330194387000},"page":"95-106","source":"Crossref","is-referenced-by-count":2,"title":["Deciding algebraic properties of monoids presented by finite church-rosser Thue systems"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"4_CR1","unstructured":"J. Avenhaus and K. Madlener, On groups defined by monadic Thue systems, Colloquium on Algebra, Combinatorics, and Logic in Computer Science, Gy\u00f6r, Hungary, Sept. 1983."},{"key":"4_CR2","unstructured":"J. Avenhaus, K. Madlener and F. Otto, Groups presented by finite two-monadic Church-Rosser Thue systems, Technical Report 110\/84, Fachbereich Informatik, Universit\u00e4t Kaiserslautern, 1984."},{"key":"4_CR3","doi-asserted-by":"crossref","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, Journal ACM 29 (1982), 171\u2013182.","journal-title":"Journal ACM"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(82)90072-X","volume":"18","author":"R. V. Book","year":"1982","unstructured":"R.V. Book, When is a monoid a group ? The Church-Rosser case is tractable, Theoret. Comput. Sci. 18 (1982), 325\u2013331.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"crossref","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, Theoret. Comput. Sci. 24 (1983), 301\u2013312.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02572811","volume":"22","author":"R. V. Book","year":"1981","unstructured":"R.V. Book and C. O'Dunlaing, Thue congruences and the Church-Rosser property, Semigroup Forum 22 (1981), 325\u2013331.","journal-title":"Semigroup Forum"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90078-5","volume":"16","author":"R. V. Book","year":"1981","unstructured":"R.V. Book and C. O'Dunlaing, Testing for the Church-Rosser property, Theoret. Comput. Sci. 16 (1981), 223\u2013229.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(85)90122-X","volume":"20","author":"R. V. Book","year":"1985","unstructured":"R.V. Book and F. Otto, Cancellation rules and extended word problems, Inf. Proc. Letters 20 (1985), 5\u201311.","journal-title":"Inf. Proc. Letters"},{"key":"4_CR9","first-page":"51","volume":"20","author":"Y. Cochet","year":"1976","unstructured":"Y. Cochet, Church-Rosser congruences on free semigroups, Coll. Math. Soc. Janos Bolyai: Algebraic Theory of Semigroups 20 (1976), 51\u201360.","journal-title":"Coll. Math. Soc. Janos Bolyai: Algebraic Theory of Semigroups"},{"key":"4_CR10","first-page":"207","volume":"174","author":"R. H. Gilman","year":"1984","unstructured":"R.H. Gilman, Computations with rational subsets of confluent groups, Proceedings of EUROSAM 1984, LNCS 174 (1984), 207\u2013212.","journal-title":"LNCS"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1090\/S0002-9947-1983-0704619-4","volume":"279","author":"R. H. Haring-Smith","year":"1983","unstructured":"R.H. Haring-Smith, Groups and simple languages, Transactions of the Amer. Math. Soc. 279 (1983), 337\u2013356.","journal-title":"Transactions of the Amer. Math. Soc."},{"key":"4_CR12","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(85)90008-8","volume":"35","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, M. Krishnamoorthy, R. Mc Naughton and P. Narendran, An O (|T|3) algorithm for testing the Church-Rosser property of Thue systems, Theoret. Comput. Sci. 35 (1985), 109\u2013114.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR14","unstructured":"G. Lallement, Semigroups and combinatorial applications, Wiley-Interscience, 1979."},{"key":"4_CR15","unstructured":"W. Magnus, A. Karrass and D. Solitar, Combinatorial group theory, 2nd revised edition, Dover, N.Y., 1976."},{"key":"4_CR16","first-page":"953","volume":"77","author":"A. Markov","year":"1951","unstructured":"A. Markov, Impossibility of algorithms for recognizing some properties of associative systems, Dokl. Akad. Nauk SSSR 77 (1951), 953\u2013956.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.2307\/2266280","volume":"17","author":"A. Mostowski","year":"1952","unstructured":"A. Mostowski, Review of [16], J. Symbolic Logic 17 (1952), 151\u2013152.","journal-title":"J. Symbolic Logic"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","volume":"26","author":"D. E. Muller","year":"1983","unstructured":"D.E. Muller and P.E. Schupp, Groups, the theory of ends, and context-free languages, J. Comput. Sys. Sci. 26 (1983), 295\u2013310.","journal-title":"J. Comput. Sys. Sci."},{"key":"4_CR19","volume-title":"Church-Rosser and related Thue systems","author":"P. Narendran","year":"1984","unstructured":"P. Narendran, Church-Rosser and related Thue systems, Ph.D. Dissertation, Rensselaer Polytechnic Institute, 1983. Also appears as Report No. 84 CRD 176, General Electric Corporate Research and Development, Schenectady, N.Y., 1984."},{"key":"4_CR20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(85)90016-7","volume":"35","author":"P. Narendran","year":"1985","unstructured":"P. Narendran and F. Otto, Complexity results on the conjugacy problem for monoids, Theoret. Comput. Sci., 35 (1985), 227\u2013243.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"F. Otto, Elements of finite order for finite monadic Church-Rosser Thue systems, Transact. of the AMS, to appear.","DOI":"10.1090\/S0002-9947-1985-0800255-1"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"F. Otto, Church-Rosser Thue systems that present free monoids, SIAM J. on Comput., to appear.","DOI":"10.1137\/0215056"}],"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-15976-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:31Z","timestamp":1619557231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15976-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159766","9783540396796"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-15976-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}