乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:28:53Z","timestamp":1725974933051},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_12","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"132-144","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complement for Two-Way Alternating Automata"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"volume-title":"The Design and Analysis of Computer Algorithms","year":"1976","author":"A Aho","key":"12_CR1","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1976)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(87)90085-8","volume":"25","author":"L Berman","year":"1987","unstructured":"Berman, L., Chang, J., Ibarra, O., Ravikumar, B.: Some observations concerning alternating Turing machines using small space. Inf. Process. Lett. 25, 1\u20139 (1987). Corr. ibid. 27, p. 53 (1988)","journal-title":"Inf. Process. Lett."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"J Birget","year":"1993","unstructured":"Birget, J.: Partial orders on words, minimal elements of regular languages, and state complexity. Theor. Comput. Sci. 119, 267\u2013291 (1993)","journal-title":"Theor. Comput. Sci."},{"volume-title":"Fundamentals of Algorithmics","year":"1996","author":"G Brassard","key":"12_CR4","unstructured":"Brassard, G., Bratley, P.: Fundamentals of Algorithmics. Prentice Hall, Upper Saddle River (1996)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A Chandra","year":"1981","unstructured":"Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. Assoc. Comput. Mach. 28, 114\u2013133 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.044","volume":"445","author":"V Geffert","year":"2012","unstructured":"Geffert, V.: An alternating hierarchy for finite automata. Theor. Comput. Sci. 445, 1\u201324 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.ic.2017.02.001","volume":"253","author":"V Geffert","year":"2017","unstructured":"Geffert, V.: Alternating space is closed under complement and other simulations for sublogarithmic space. Inf. Comput. 253, 163\u2013178 (2017)","journal-title":"Inf. Comput."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.ic.2007.01.008","volume":"205","author":"V Geffert","year":"2007","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Inf. Comput. 205, 1173\u20131187 (2007)","journal-title":"Inf. Comput."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-662-44522-8_25","volume-title":"Mathematical Foundations of Computer Science 2014","author":"V Geffert","year":"2014","unstructured":"Geffert, V., Okhotin, A.: Transforming two-way alternating finite automata to one-way nondeterministic automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 291\u2013302. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_25"},{"volume-title":"Introduction to Automata Theory, Languages, and Computation","year":"2001","author":"J Hopcroft","key":"12_CR10","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (2001)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-02737-6_4","volume-title":"Developments in Language Theory","author":"CA Kapoutsis","year":"2009","unstructured":"Kapoutsis, C.A.: Size complexity of two-way finite automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 47\u201366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_4"},{"key":"12_CR12","first-page":"205","volume":"17","author":"C Kapoutsis","year":"2012","unstructured":"Kapoutsis, C.: Minicomplexity. J. Autom. Lang. Comb. 17, 205\u2013224 (2012)","journal-title":"J. Autom. Lang. Comb."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-40313-2_53","volume-title":"Mathematical Foundations of Computer Science 2013","author":"M Kunc","year":"2013","unstructured":"Kunc, M., Okhotin, A.: Reversibility of computations in graph-walking automata. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 595\u2013606. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_53"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"R Ladner","year":"1984","unstructured":"Ladner, R., Lipton, R., Stockmeyer, L.: Alternating pushdown and stack automata. SIAM J. Comput. 13, 135\u2013155 (1984)","journal-title":"SIAM J. Comput."},{"volume-title":"Complexity Theory Retrospective II","year":"1997","author":"M Li\u015bkiewicz","key":"12_CR15","unstructured":"Li\u015bkiewicz, M., Reischuk, R.: Computing with sublogarithmic space. In: Hemaspaandra, L., Selman, A. (eds.) Complexity Theory Retrospective II. Springer, New York (1997). ISBN 978-0-387-94973-4"},{"volume-title":"Computational Complexity","year":"1994","author":"CH Papadimitriou","key":"12_CR16","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58355-6","volume-title":"Turing Machines with Sublogarithmic Space","author":"A Szepietowski","year":"1994","unstructured":"Szepietowski, A.: Turing Machines with Sublogarithmic Space. LNCS, vol. 843. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58355-6"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:30:08Z","timestamp":1710243008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}