{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:23Z","timestamp":1725731363803},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393099"},{"type":"electronic","value":"9783642393105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_19","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"194-204","source":"Crossref","is-referenced-by-count":0,"title":["A Characterisation of NL\/poly via Nondeterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Rob","family":"Myers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-58338-6_74","volume-title":"Mathematical Foundations of Computer Science 1994","author":"C. Damm","year":"1994","unstructured":"Damm, C., Holzer, M.: Inductive counting below logspace. In: Privara, I., Ru\u017ei\u010dka, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol.\u00a0841, pp. 276\u2013285. Springer, Heidelberg (1994)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/11779148_33","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2006","unstructured":"Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 363\u2013374. Springer, Heidelberg (2006)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Hromkovic, J.: Communication complexity and parallel computing. Texts in theoretical computer science. Springer (1997)","DOI":"10.1007\/978-3-662-03442-2"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45022-X_17","volume-title":"Automata, Languages and Programming","author":"J. Hromkovic","year":"2000","unstructured":"Hromkovic, J., Karhumki, J., Klauck, H., Schnitger, G., Seibert, S.: Measures of nondeterminism in finite automata. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 199\u2013210. Springer, Heidelberg (2000)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Boolean Function Complexity - Advances and Frontiers. Algorithms and combinatorics, vol.\u00a027. Springer (2012)","DOI":"10.1007\/978-3-642-24508-4"},{"key":"19_CR6","unstructured":"Jukna, S.: What have read-once branching programs to do with nl\/poly? (2013), \n                  \n                    http:\/\/www.thi.informatik.uni-frankfurt.de\/~jukna\/boolean\/comments.html\n                  \n                  \n                 (online, see Comment 12)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/800141.804678","volume-title":"Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC 1980","author":"R.M. Karp","year":"1980","unstructured":"Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC 1980, pp. 302\u2013309. ACM, New York (1980)"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1006\/jcss.2001.1783","volume":"63","author":"H. Leung","year":"2001","unstructured":"Leung, H.: Tight lower bounds on the size of sweeping automata. J. Comput. Syst. Sci.\u00a063(3), 384\u2013393 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-54458-5_49","volume-title":"Fundamentals of Computation Theory","author":"A.A. Razborov","year":"1991","unstructured":"Razborov, A.A.: Lower bounds for deterministic and nondeterministic branching programs. In: Budach, L. (ed.) FCT 1991. LNCS, vol.\u00a0529, pp. 47\u201360. Springer, Heidelberg (1991)"},{"key":"19_CR10","unstructured":"Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 244\u2013253 (1997)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: STOC, pp. 275\u2013286. ACM (1978)","DOI":"10.1145\/800133.804357"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(80)90034-3","volume":"21","author":"M. Sipser","year":"1980","unstructured":"Sipser, M.: Lower bounds on the size of sweeping automata. J. Comput. Syst. Sci.\u00a021(2), 195\u2013202 (1980)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39310-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T03:51:56Z","timestamp":1557805916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}