{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:28Z","timestamp":1725738568819},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_33","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"361-372","source":"Crossref","is-referenced-by-count":1,"title":["Rational Subsets and Submonoids of Wreath Products"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Steinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-33_CR1.1","unstructured":"Anisimov, A.V.: Group languages. Kibernetika\u00a04, 18-24 (1971) (in Russian)"},{"key":"#cr-split#-33_CR1.2","unstructured":"English translation. Cybernetics 4, 594-601 (1973)"},{"key":"33_CR2","first-page":"1188","volume":"269","author":"M. Benois","year":"1969","unstructured":"Benois, M.: Parties rationnelles du groupe libre. C. R. Acad. Sci. Paris, S\u00e9r. A\u00a0269, 1188\u20131190 (1969)","journal-title":"C. R. Acad. Sci. Paris, S\u00e9r. A"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-77050-3_22","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"P. Chambart","year":"2007","unstructured":"Chambart, P., Schnoebelen, P.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 265\u2013276. Springer, Heidelberg (2007)"},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2140\/pjm.2006.228.53","volume":"228","author":"S. Cleary","year":"2006","unstructured":"Cleary, S.: Distortion of wreath products in some finitely-presented groups. Pacific Journal of Mathematics\u00a0228(1), 53\u201361 (2006)","journal-title":"Pacific Journal of Mathematics"},{"issue":"12","key":"33_CR5","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1016\/j.jpaa.2011.04.018","volume":"215","author":"T.C. Davis","year":"2011","unstructured":"Davis, T.C., Olshanskii, A.Y.: Subgroup distortion in wreath products of cyclic groups. Journal of Pure and Applied Algebra\u00a0215(12), 2987\u20133004 (2011)","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"6","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1142\/S0218196706003372","volume":"16","author":"V. Diekert","year":"2006","unstructured":"Diekert, V., Muscholl, A.: Solvability of equations in free partially commutative groups is decidable. International Journal of Algebra and Computation\u00a016(6), 1047\u20131069 (2006)","journal-title":"International Journal of Algebra and Computation"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theor. Comput. Sci.\u00a027, 311\u2013332 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.P.: Rational sets in commutative monoids. Journal of Algebra\u00a013, 173\u2013191 (1969)","journal-title":"Journal of Algebra"},{"issue":"1-2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0304-3975(01)00282-1","volume":"276","author":"H. Fernau","year":"2002","unstructured":"Fernau, H., Stiebe, R.: Sequential grammars and automata with valences. Theor. Comput. Sci.\u00a0276(1-2), 377\u2013405 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Gilman, R.H.: Formal languages and infinite groups. In: Geometric and Computational Perspectives on Infinite Groups DIMACS Ser. Discrete Math. Theoret. Comput. Sci, vol.\u00a025, pp. 27\u201351. AMS (1996)","DOI":"10.1090\/dimacs\/025\/03"},{"key":"33_CR12","unstructured":"Grunschlag, Z.: Algorithms in Geometric Group Theory. PhD thesis, University of California at Berkley (1999)"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","volume":"6","author":"L.H. Haines","year":"1969","unstructured":"Haines, L.H.: On free monoids partially ordered by embedding. Journal of Combinatorial Theory\u00a06, 94\u201398 (1969)","journal-title":"Journal of Combinatorial Theory"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society. Third Series\u00a02, 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society. Third Series"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-70583-3_5","volume-title":"Automata, Languages and Programming","author":"T. Jurdzi\u0144ski","year":"2008","unstructured":"Jurdzi\u0144ski, T.: Leftist grammars are non-primitive recursive. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 51\u201362. Springer, Heidelberg (2008)"},{"issue":"1","key":"33_CR16","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(1), 193\u2013208 (2009)","journal-title":"Communications in Algebra"},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.jalgebra.2006.05.020","volume":"309","author":"M. Kambites","year":"2007","unstructured":"Kambites, M., Silva, P.V., Steinberg, B.: On the rational subset problem for groups. Journal of Algebra\u00a0309(2), 622\u2013639 (2007)","journal-title":"Journal of Algebra"},{"issue":"2\u20133","key":"33_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.tcs.2005.09.018","volume":"348","author":"M. Kunc","year":"2005","unstructured":"Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theor. Comput. Sci.\u00a0348(2\u20133), 277\u2013293 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"33_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.apal.2004.06.002","volume":"131","author":"D. Kuske","year":"2005","unstructured":"Kuske, D., Lohrey, M.: Logical aspects of Cayley-graphs: the group case. Annals of Pure and Applied Logic\u00a0131(1\u20133), 263\u2013286 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/11787006_43","volume-title":"Automata, Languages and Programming","author":"M. Lohrey","year":"2006","unstructured":"Lohrey, M., S\u00e9nizergues, G.: Theories of HNN-extensions and amalgamated products. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 504\u2013515. Springer, Heidelberg (2006)"},{"issue":"2","key":"33_CR21","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.jalgebra.2007.08.025","volume":"320","author":"M. Lohrey","year":"2008","unstructured":"Lohrey, M., Steinberg, B.: The submonoid and rational subset membership problems for graph groups. Journal of Algebra\u00a0320(2), 728\u2013755 (2008)","journal-title":"Journal of Algebra"},{"issue":"4","key":"33_CR22","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1016\/j.jalgebra.2009.09.040","volume":"324","author":"M. Lohrey","year":"2010","unstructured":"Lohrey, M., Steinberg, B.: Submonoids and rational subsets of groups with infinitely many ends. Journal of Algebra\u00a0324(4), 970\u2013983 (2010)","journal-title":"Journal of Algebra"},{"issue":"2","key":"33_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-010-9264-9","volume":"48","author":"M. Lohrey","year":"2011","unstructured":"Lohrey, M., Steinberg, B.: Tilings and submonoids of metabelian groups. Theory Comput. Syst.\u00a048(2), 411\u2013427 (2011)","journal-title":"Theory Comput. Syst."},{"key":"33_CR24","unstructured":"Lohrey, M., Steinberg, B., Zetzsche, G.: Rational subsets and submonoids of wreath products. arXiv.org (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1302.2455"},{"key":"33_CR25","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer (1977)"},{"key":"33_CR26","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall International (1967)"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Motwani, R., Panigrahy, R., Saraswat, V.A., Venkatasubramanian, S.: On the decidability of accessibility problems (extended abstract). In: Proc.\u00a0STOC 2000, pp. 306\u2013315. ACM (2000)","DOI":"10.1145\/335305.335341"},{"key":"33_CR28","unstructured":"Roman\u2019kov, V.: On the occurence problem for rational subsets of a group. In: International Conference on Combinatorial and Computational Methods in Mathematics, pp. 76\u201381 (1999)"},{"issue":"1","key":"33_CR29","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01462922","volume":"13","author":"N.S. Romanovskii","year":"1974","unstructured":"Romanovskii, N.S.: Some algorithmic problems for solvable groups. Algebra i Logika 13(1), 26\u201334 (1974)","journal-title":"Algebra i Logika"},{"key":"33_CR30","first-page":"170","volume":"21","author":"N.S. Romanovskii","year":"1980","unstructured":"Romanovskii, N.S.: The occurrence problem for extensions of abelian groups by nilpotent groups. Sibirsk. Mat. Zh.\u00a021, 170\u2013174 (1980)","journal-title":"Sibirsk. Mat. Zh."},{"key":"33_CR31","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"issue":"5","key":"33_CR32","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett.\u00a083(5), 251\u2013261 (2002)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:39:48Z","timestamp":1557898788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}