{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:10:07Z","timestamp":1742915407175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_29","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"340-351","source":"Crossref","is-referenced-by-count":3,"title":["The Monoid of Queue Actions"],"prefix":"10.1007","author":[{"given":"Martin","family":"Huschenbett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dietrich","family":"Kuske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and context-free languages. Teubner Studienb\u00fccher, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"6","key":"29_CR2","first-page":"641","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: Automata and interpretations. ACM Transactions on Computer Systems\u00a037(6), 641\u2013674 (2004)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"1-2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(99)00151-6","volume":"250","author":"C.M. Campbell","year":"2001","unstructured":"Campbell, C.M., Robertson, E.F., Ru\u0161kuc, N., Thomas, R.M.: Automatic semigroups. Theoretical Computer Science\u00a0250(1-2), 365\u2013391 (2001)","journal-title":"Theoretical Computer Science"},{"key":"29_CR4","volume-title":"Word processing in groups","author":"J.W. Cannon","year":"1992","unstructured":"Cannon, J.W., Epstein, D.B.A., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word processing in groups. Jones and Barlett Publ., Boston (1992)"},{"issue":"2","key":"29_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1142\/S0218196793000135","volume":"3","author":"C. Choffrut","year":"1993","unstructured":"Choffrut, C.: Conjugacy in free inverse monoids. Int. J. Algebra Comput.\u00a03(2), 169\u2013188 (1993)","journal-title":"Int. J. Algebra Comput."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","volume":"46","author":"C. Duboc","year":"1986","unstructured":"Duboc, C.: On some equations in free partially commutative monoids. Theoretical Computer Science\u00a046, 159\u2013174 (1986)","journal-title":"Theoretical Computer Science"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Duncan, A.J., Robertson, E.F., Ru\u0161kuc, N.: Automatic monoids and change of generators. Mathematical Proceedings of the Cambridge Philosophical Society\u00a0127, 403\u2013409, 11 (1999)","DOI":"10.1017\/S0305004199003722"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theoretical Computer Science\u00a0108, 45\u201382 (1993)","journal-title":"Theoretical Computer Science"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Huschenbett, M., Kuske, D., Zetzsche, G.: The monoid of queue actions. preprint arXiv:1404.5479 (2014)","DOI":"10.1007\/978-3-662-44522-8_29"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/00927870802243580","volume":"37","author":"M. Kambites","year":"2009","unstructured":"Kambites, M.: Formal languages and groups as memory. Communications in Algebra\u00a037, 193\u2013208 (2009)","journal-title":"Communications in Algebra"},{"key":"29_CR11","unstructured":"Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups. preprint arXiv:1107.3645 (2011)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"29_CR13","unstructured":"Lentin, A., Sch\u00fctzenberger, M.-P.: A combinatorial problem in the theory of free monoids. In: Combin. Math. Appl., Proc. Conf. Univ. North Carolina 1967, pp. 128\u2013144 (1969)"},{"key":"29_CR14","unstructured":"Lohrey, M.: The rational subset membership problem for groups: A survey (2013) (to appear)"},{"key":"29_CR15","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol.\u00a017. Addison-Wesley (1983)"},{"key":"29_CR16","first-page":"169","volume":"133","author":"V.A. Osipova","year":"1973","unstructured":"Osipova, V.A.: On the conjugacy problem in semigroups. Proc. Steklov Inst. Math.\u00a0133, 169\u2013182 (1973)","journal-title":"Proc. Steklov Inst. Math."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF02573327","volume":"29","author":"F. Otto","year":"1984","unstructured":"Otto, F.: Conjugacy in monoids with a special Church-Rosser presentation is decidable. Semigroup Forum\u00a029, 223\u2013240 (1984)","journal-title":"Semigroup Forum"},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0021-8693(91)90275-D","volume":"143","author":"L. Zhang","year":"1991","unstructured":"Zhang, L.: Conjugacy in special monoids. J. of Algebra\u00a0143(2), 487\u2013497 (1991)","journal-title":"J. of Algebra"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T09:54:59Z","timestamp":1676886899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}