{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:32Z","timestamp":1725488612222},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_23","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:32:26Z","timestamp":1186727546000},"page":"227-239","source":"Crossref","is-referenced-by-count":1,"title":["Divisibility Monoids: Presentation, Word Problem, and Rational Languages"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"G. Berry. Stable models of typed \u03bb-calculi. In 5th ICALP, Lecture Notes in Comp. Science vol. 62, pages 72\u201389. Springer, 1978.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"23_CR2","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1973","unstructured":"G. Birkhoff. Lattice Theory. Colloquium Publications vol. 25. American Mathematical Society, Providence, 1973."},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0013091500004995","volume":"34","author":"B. Bosbach","year":"1991","unstructured":"B. Bosbach. Representable divisibility semigroups. Proc. Edinb. Math. Soc., II. Ser., 34(1):45\u201364, 1991.","journal-title":"Proc. Edinb. Math. Soc., II. Ser."},{"key":"23_CR4","first-page":"1","volume-title":"Proc. Intern. Congress on Logic, Methodology and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1960","unstructured":"J.R. B\u00fcchi. On a decision method in restricted second order arithmetics. In E. Nagel et al., editor, Proc. Intern. Congress on Logic, Methodology and Philosophy of Science, pages 1\u201311. Stanford University Press, Stanford, 1960."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(99)00151-6","volume":"250","author":"C. M. Campbell","year":"2001","unstructured":"C. M. Campbell, E. F. Robertson, N. Ru\u0161kuc, and R. M. Thomas. Automatic semigroups. Theoretical Computer Science, 250:365\u2013391, 2001.","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"R. Corran. On monoids related to braid groups. PhD thesis, University of Sydney, 2000.","DOI":"10.1017\/S0004972700019808"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1112\/S0024611599012071","volume":"79","author":"P. Dehornoy","year":"1999","unstructured":"P. Dehornoy and L. Paris. Gaussian groups and Garside groups, two generalizations of Artin groups. Proc. London Math. Soc., 79:569\u2013604, 1999.","journal-title":"Proc. London Math. Soc."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"V. Diekert. Combinatorics on Traces. Lecture Notes in Comp. Science vol. 454. Springer, 1990.","DOI":"10.1007\/3-540-53031-2"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"V. Diekert and G. Rozenberg. The Book of Traces. World Scientific Publ. Co., 1995.","DOI":"10.1142\/2563"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(94)00266-L","volume":"150","author":"M. Droste","year":"1995","unstructured":"M. Droste. Recognizable languages in concurrency monoids. Theoretical Comp. Science, 150:77\u2013109, 1995.","journal-title":"Theoretical Comp. Science"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"M. Droste and D. Kuske. On recognizable languages in divisibility monoids. In G. Ciobanu and Gh. Paun, editors, FCT99, Lecture Notes in Comp. Science vol. 1684, pages 246\u2013257. Springer, 1999.","DOI":"10.1007\/3-540-48321-7_20"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"M. Droste and D. Kuske. Recognizable languages in divisibility monoids. Mathematical Structures in Computer Science, 2000. To appear.","DOI":"10.1017\/S0960129501003395"},{"key":"23_CR13","unstructured":"C. Duboc. Commutations dans les mono\u00efdes libres: un cadre th\u00e9orique pour l\u2019\u00e9tude du parallelisme. Th\u00e8se, Facult\u00e9 des Sciences de l\u2019Universit\u00e9 de Rouen, 1986."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"C.C. Elgot and G. Mezei. On relations defined by generalized finite automata. IBM J. Res. Develop., 9:47\u201365, 1965.","journal-title":"IBM J. Res. Develop."},{"key":"23_CR15","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word Processing In Groups","author":"D.B.A. Epstein","year":"1992","unstructured":"D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Paterson, and W.P. Thurston. Word Processing In Groups. Jones and Bartlett Publishers, Boston, 1992."},{"key":"23_CR16","unstructured":"The GAP Group, Aachen, St Andrews. GAP-Groups, Algorithms, and Programming, Version 4.2, 1999. ( http:\/\/www-gap.dcs.st-and.ac.uk\/~gap )."},{"key":"23_CR17","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, Singapure, 1996. World Scientific."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"S.C. Kleene. Representation of events in nerve nets and finite automata. In C.E. Shannon and J. McCarthy, editors, Automata Studies, Annals of Mathematics Studies vol. 34, pages 3\u201340. Princeton University Press, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"23_CR19","unstructured":"D. Kuske. Contributions to a Trace Theory beyond Mazurkiewicz Traces. Technical report, TU Dresden, 1999."},{"key":"23_CR20","unstructured":"D. Kuske. On rational and on left divisibility monoids. Technical Report MATHAL-3-1999, TU Dresden, 1999."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"23_CR22","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"E. Ochma\u0144ski. Regular behaviour of concurrent systems. Bull. Europ. Assoc. for Theor. Comp. Science, 27:56\u201367, 1985.","journal-title":"Bull. Europ. Assoc. for Theor. Comp. Science"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0890-5401(90)90003-Z","volume":"88","author":"M. Peletier","year":"1990","unstructured":"M. Peletier and J. Sakarovitch. Easy multiplications. II. Extensions of rational semigroups. Information and Computation, 88:18\u201359, 1990.","journal-title":"Information and Computation"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"F.P. Ramsey. On a problem of formal logic. Proc. London Math. Soc., 30:264\u2013286, 1930.","journal-title":"Proc. London Math. Soc."},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0890-5401(87)90020-4","volume":"74","author":"J. Sakarovitch","year":"1987","unstructured":"J. Sakarovitch. Easy multiplications. I. The realm of Kleene\u2019s Theorem. Information and Computation, 74:173\u2013197, 1987.","journal-title":"Information and Computation"},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"M.P. Sch\u00fctzenberger. On the definition of a family of automata. Inf. Control, 4:245\u2013270, 1961.","journal-title":"Inf. Control"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Comp. Science vol. 255, pages 325\u2013392. Springer, 1987.","DOI":"10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:13:15Z","timestamp":1556734395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}