乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:33:11Z","timestamp":1725823991360},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_11","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"134-145","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Solution Sets for Equations over Free Groups are EDT0L Languages"],"prefix":"10.1007","author":[{"given":"Laura","family":"Ciobanu","sequence":"first","affiliation":[]},{"given":"Volker","family":"Diekert","sequence":"additional","affiliation":[]},{"given":"Murray","family":"Elder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"AV Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars\u2013an extension of context-free grammars. J. Assoc. Comput. Mach. 15, 647\u2013671 (1968)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/S0019-9958(77)90308-4","volume":"34","author":"PR Asveld","year":"1977","unstructured":"Asveld, P.R.: Controlled iteration grammars and full hyper-AFL\u2019s. Information and Control 34(3), 248\u2013269 (1977)","journal-title":"Information and Control"},{"key":"11_CR3","first-page":"1188","volume":"269","author":"M Benois","year":"1969","unstructured":"Benois, M.: Parties rationelles du groupe libre. C. R. Acad. Sci. Paris, S\u00e9r. A 269, 1188\u20131190 (1969)","journal-title":"C. R. Acad. Sci. Paris, S\u00e9r. A"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Diekert, V., Guti\u00e9rrez, C., Hagenah, Ch.: The existential theory of equations with rational constraints in free groups is $${\\sf PSPACE}$$-complete. Information and Computation, 202, 105\u2013140 (2005). Conference version in STACS 2001","DOI":"10.1016\/j.ic.2005.04.002"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computer Science - Theory and Applications","author":"V Diekert","year":"2014","unstructured":"Diekert, V., Je\u017c, A., Plandowski, W.: Finding all solutions of equations in free groups and monoids with involution. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.\u00c9., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 1\u201315. Springer, Heidelberg (2014)"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1051\/ita\/1977110402731","volume":"11","author":"A Ehrenfeucht","year":"1977","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On some context free languages that are not deterministic ET0L languages. RAIRO Theor. Inform. Appl. 11, 273\u2013291 (1977)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"11_CR7","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol. A. Acad Press (1974)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00224-013-9489-5","volume":"54","author":"J Fert\u00e9","year":"2014","unstructured":"Fert\u00e9, J., Marin, N., S\u00e9nizergues, G.: Word-mappings of level $$2$$. Theory Comput. Syst. 54, 111\u2013148 (2014)","journal-title":"Theory Comput. Syst."},{"key":"11_CR9","unstructured":"Gilman, R.H.: Personal communication (2012)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Jain, S., Miasnikov, A., Stephan, F.: The complexity of verbal languages over groups. In: Proc. LICS 2012, pp. 405\u2013414. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.50"},{"key":"11_CR11","unstructured":"Je\u017c, A.: Recompression: a simple and powerful technique for word equations. In: Proc. STACS. LIPIcs, 20:233\u2013244 (2013). Journal version to appear in JACM"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.jalgebra.2006.03.033","volume":"302","author":"O Kharlampovich","year":"2006","unstructured":"Kharlampovich, O., Myasnikov, A.: Elementary theory of free non-abelian groups. J. of Algebra 302, 451\u2013552 (2006)","journal-title":"J. of Algebra"},{"key":"11_CR13","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: An efficient algorithm for solving word equations. Proc. STOC 2006, pp. 467\u2013476. ACM Press (2006)","DOI":"10.1145\/1132516.1132584"},{"key":"11_CR15","unstructured":"Plandowski, W.: Personal communication (2014)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/BFb0055097","volume-title":"Automata, Languages and Programming","author":"W Plandowski","year":"1998","unstructured":"Plandowski, W., Rytter, W.: Application of Lempel-Ziv encodings to the solution of word equations. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 731\u2013742. Springer, Heidelberg (1998)"},{"key":"11_CR17","unstructured":"Razborov, A.A.: On Systems of Equations in Free Groups. Ph.D thesis (1987)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: On systems of equations in free groups. In: Combinatorial and Geometric Group Theory, pp. 269\u2013283. Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511566073.022"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A.: The Book of L. Springer (1986)","DOI":"10.1007\/978-3-642-95486-3"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., et al. (Eds.): Handbook of Formal Languages, vol 1. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"787","DOI":"10.4007\/annals.2013.177.3.1","volume":"177","author":"Z Sela","year":"2013","unstructured":"Sela, Z.: Diophantine geometry over groups VIII: Stability. Annals of Math. 177, 787\u2013868 (2013)","journal-title":"Annals of Math."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:53:14Z","timestamp":1676584394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}