{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:01Z","timestamp":1725860761787},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_14","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"163-175","source":"Crossref","is-referenced-by-count":0,"title":["A Logical Characterization of Small 2NFAs"],"prefix":"10.1007","author":[{"given":"Christos A.","family":"Kapoutsis","sequence":"first","affiliation":[]},{"given":"Lamana","family":"Mulaffer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"issue":"1\u20136","key":"14_CR1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"RJ 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 6(1\u20136), 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"14_CR2","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. VII, pp. 43\u201373 (1974)"},{"issue":"5","key":"14_CR3","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"14_CR4","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1998","unstructured":"Immerman, N.: Descriptive Complexity. Springer, New York (1998)"},{"issue":"2\u20134","key":"14_CR5","first-page":"205","volume":"17","author":"C Kapoutsis","year":"2012","unstructured":"Kapoutsis, C.: Minicomplexity. J. Automata Lang. Comb. 17(2\u20134), 205\u2013224 (2012)","journal-title":"J. Automata Lang. Comb."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/978-3-642-31653-1_19","volume-title":"Developments in Language Theory","author":"CA Kapoutsis","year":"2012","unstructured":"Kapoutsis, C.A., Lefebvre, N.: Analogs of Fagin\u2019s Theorem for small nondeterministic finite automata. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 202\u2013213. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:50:47Z","timestamp":1498312247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}