{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:56:58Z","timestamp":1725469018540},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_26","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"292-304","source":"Crossref","is-referenced-by-count":2,"title":["Partially Commutative Inverse Monoids"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BFb0048939","volume-title":"Programming Languages and their Definition","author":"H. Bekic","year":"1984","unstructured":"Bekic, H.: Definable operation in general algebras, and the theory of automata and flowcharts. In: Bekic, H. (ed.) Programming Languages and their Definition. LNCS, vol.\u00a0177, pp. 30\u201355. Springer, Heidelberg (1984)"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"Cori, R., Perrin, D.: Automates et commutations partielles. RAIRO \u2014 Inform. Th\u00e9or. Appl.\u00a019, 21\u201332 (1985)","journal-title":"RAIRO \u2014 Inform. Th\u00e9or. Appl."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53031-2","volume-title":"Combinatorics on Traces","author":"V. Diekert","year":"1990","unstructured":"Diekert, V.: Combinatorics on Traces. LNCS, vol.\u00a0454. Springer, Heidelberg (1990)"},{"volume-title":"The Book of Traces","year":"1995","key":"26_CR4","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/0021-8693(87)90010-X","volume":"106","author":"C. Droms","year":"1985","unstructured":"Droms, C.: Graph groups, coherence and three-manifolds. J. Algebra\u00a0106(2), 484\u2013489 (1985)","journal-title":"J. Algebra"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S021819670500213X","volume":"15","author":"I. Kapovich","year":"2005","unstructured":"Kapovich, I., Weidmann, R., Myasnikov, A.: Foldings, graphs of groups and the membership problem. Internat. J. Algebra Comput.\u00a015(1), 95\u2013128 (2005)","journal-title":"Internat. J. Algebra Comput."},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/10722167_7","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: An automata-theoretic approach to reasoning about infinite-state systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 36\u201352. Springer, Heidelberg (2000)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/11549345_57","volume-title":"Mathematical Foundations of Computer Science 2005","author":"M. Lohrey","year":"2005","unstructured":"Lohrey, M., Ondrusch, N.: Inverse monoids: decidability and complexity of algebraic questions. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 664\u2013675. Springer, Heidelberg (2005)"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0022-4049(89)90052-2","volume":"58","author":"S. Margolis","year":"1989","unstructured":"Margolis, S., Meakin, J.: E-unitary inverse monoids and the Cayley graph of a group presentation. J. Pure Appl. Algebra\u00a058(1), 45\u201376 (1989)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2154268","volume":"335","author":"S. Margolis","year":"1993","unstructured":"Margolis, S., Meakin, J.: Inverse monoids, trees, and context-free languages. Trans. Amer. Math. Soc.\u00a0335(1), 259\u2013276 (1993)","journal-title":"Trans. Amer. Math. Soc."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-94-011-0149-3_6","volume-title":"Semigroups, Formal Languages and Groups","author":"S. Margolis","year":"1995","unstructured":"Margolis, S., Meakin, J., Sapir, M.: Algorithmic problems in groups, semigroups and inverse semigroups. In: Semigroups, Formal Languages and Groups, pp. 147\u2013214. Kluwer, Dordrecht (1995)"},{"issue":"1","key":"26_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1112\/jlms\/53.1.79","volume":"53","author":"J. Meakin","year":"1996","unstructured":"Meakin, J., Sapir, M.: The word problem in the variety of inverse semigroups with Abelian covers. J. London Math. Soc. (2)\u00a053(1), 79\u201398 (1996)","journal-title":"J. London Math. Soc. (2)"},{"key":"26_CR13","unstructured":"Mihailova, K.A.: The occurrence problem for direct products of groups. Math. USSR Sbornik\u00a070, 241\u2013251 (1966) (English translation)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/plms\/s3-29.3.385","volume":"30","author":"W. Munn","year":"1974","unstructured":"Munn, W.: Free inverse semigroups. Proc. London Math. Soc.\u00a030, 385\u2013404 (1974)","journal-title":"Proc. London Math. Soc."},{"key":"26_CR15","volume-title":"Inverse semigroups","author":"M. Petrich","year":"1984","unstructured":"Petrich, M.: Inverse semigroups. Wiley, Chichester (1984)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-4049(90)90057-O","volume":"63","author":"J. Stephen","year":"1990","unstructured":"Stephen, J.: Presentations of inverse monoids. J. Pure Appl. Algebra\u00a063, 81\u2013112 (1990)","journal-title":"J. Pure Appl. Algebra"},{"key":"26_CR17","unstructured":"Veloso da Costa, A.: \u0393-Produtos de Mon\u00f3ides e Semigrupos. PhD thesis, Universidade do Porto (2003)"},{"issue":"2","key":"26_CR18","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: games and model-checking. Inform. and Comput.\u00a0164(2), 234\u2013263 (2001)","journal-title":"Inform. and Comput."},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0747-7171(88)80024-5","volume":"6","author":"C. Wrathall","year":"1988","unstructured":"Wrathall, C.: The word problem for free partially commutative groups. J. Symbolic Comput.\u00a06(1), 99\u2013104 (1988)","journal-title":"J. Symbolic Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:37Z","timestamp":1619508637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11821069_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}