{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:17:11Z","timestamp":1725466631489},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_19","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"202-213","source":"Crossref","is-referenced-by-count":2,"title":["Analogs of Fagin\u2019s Theorem for Small Nondeterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Christos A.","family":"Kapoutsis","sequence":"first","affiliation":[]},{"given":"Nans","family":"Lefebvre","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01201276","volume":"29","author":"J.-C. Birget","year":"1996","unstructured":"Birget, J.-C.: Two-way automata and length-preserving homomorphisms. Mathematical Systems Theory\u00a029, 191\u2013226 (1996)","journal-title":"Mathematical Systems Theory"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer (1997)","DOI":"10.1007\/978-1-4612-0701-6"},{"issue":"1-6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"R.J. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, R.J.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a06(1-6), 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"19_CR4","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R.M. (ed.) Complexity of Computation. AMS-SIAM Symposia in Applied Mathematics, vol.\u00a0VII, pp. 43\u201373 (1974)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Descriptive complexity. Springer (1998)","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"19_CR6","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":"C.A. Kapoutsis","year":"2009","unstructured":"Kapoutsis, C.A.: Size Complexity of Two-Way Finite Automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 47\u201366. Springer, Heidelberg (2009)"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/j.jcss.2011.06.004","volume":"78","author":"C. Kapoutsis","year":"2012","unstructured":"Kapoutsis, C., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: Size complexity of rotating and sweeping automata. Journal of Computer and System Sciences\u00a078(2), 537\u2013558 (2012)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR8","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-36387-4_13","volume-title":"Automata, Logics, and Infinite Games","author":"K. Reinhardt","year":"2002","unstructured":"Reinhardt, K.: The Complexity of Translating Logic to Finite Automata. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500, pp. 231\u2013238. Springer, Heidelberg (2002)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of STOC, pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences\u00a025(3), 360\u2013376 (1982)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:41:29Z","timestamp":1620128489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}