{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:59:15Z","timestamp":1725861555266},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"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-42634-1_47","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"587-598","source":"Crossref","is-referenced-by-count":1,"title":["Cost Register Automata for Nested Words"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Krebs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nutan","family":"Limaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Ludwig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"47_CR1","unstructured":"Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajek, J. (ed.) Complexity of Computations and Proofs, Quaderni di Matematica (2004)"},{"key":"47_CR2","unstructured":"Allender, E., Arvind, V., Mahajan, M.: Arithmetic complexity, kleene closure, and formal power series. Technical report (1997)"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-3-319-15579-1_35","volume-title":"Language and Automata Theory and Applications","author":"E Allender","year":"2015","unstructured":"Allender, E., Mertz, I.: Complexity of regular functions. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 449\u2013460. Springer, Heidelberg (2015)"},{"key":"47_CR4","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan,Y.: Regular functions, cost register automata, and generalized min-cost problems. CoRR, abs\/1111.0670 (2011)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, 25\u201328 June 2013, pp. 13\u201322 (2013)","DOI":"10.1109\/LICS.2013.65"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Barrington, D., Therien, D.: Finite monoids and the fine structure of NC1. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 101\u2013109, New York, NY, USA. ACM (1987)","DOI":"10.1145\/28395.28407"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 1\u20135, New York, NY, USA. ACM (1986)","DOI":"10.1145\/12130.12131"},{"issue":"3","key":"47_CR9","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/0022-0000(92)90014-A","volume":"44","author":"DA Mix Barrington","year":"1992","unstructured":"Mix Barrington, D.A., Compton, K.J., Straubing, H., Th\u00e9rien, D.: Regular Languages in NC $$^1$$ . J. Comput. Syst. Sci. 44(3), 478\u2013499 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"47_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(93)90253-P","volume":"107","author":"F B\u00e9dard","year":"1993","unstructured":"B\u00e9dard, F., Lemieux, F., McKenzie, P.: Extensions to Barrington\u2019s M-program model. Theor. Comput. Sci. 107(1), 31\u201361 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: The boolean formula value problem is in ALOGTIME. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 123\u2013131 (1987)","DOI":"10.1145\/28395.28409"},{"issue":"4","key":"47_CR12","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1137\/0221046","volume":"21","author":"SR Buss","year":"1992","unstructured":"Buss, S.R., Cook, S.A., Gupta, A., Ramachandran, V.: An optimal parallel algorithm for formula evaluation. SIAM J. Comput. 21(4), 755\u2013780 (1992)","journal-title":"SIAM J. Comput."},{"key":"47_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-642-31653-1_21","volume-title":"Developments in Language Theory","author":"M Caralp","year":"2012","unstructured":"Caralp, M., Reynier, P.-A., Talbot, J.-M.: Visibly pushdown automata with multiplicities: finiteness and k-boundedness. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 226\u2013238. Springer, Heidelberg (2012)"},{"issue":"2","key":"47_CR14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1006\/jcss.1998.1588","volume":"57","author":"H Caussinus","year":"1998","unstructured":"Caussinus, H., McKenzie, P., Th\u00e9rien, D., Vollmer, H.: Nondeterministic NC $$^1$$ computation. J. Comput. Syst. Sci. 57(2), 200\u2013212 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"13","key":"47_CR15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"SA Cook","year":"1985","unstructured":"Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Inf. Control 64(13), 2\u201322 (1985). International Conference on Foundations of Computation Theory","journal-title":"Inf. Control"},{"issue":"5","key":"47_CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(88)90148-2","volume":"26","author":"PW Dymond","year":"1988","unstructured":"Dymond, P.W.: Input-driven languages are in log n depth. Inf. Process. Lett. 26(5), 247\u2013250 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"47_CR17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00453-011-9501-x","volume":"64","author":"A Krebs","year":"2012","unstructured":"Krebs, A., Limaye, N., Mahajan, M.: Counting paths in VPA is complete for #NC $$^1$$ . Algorithmica 64(2), 279\u2013294 (2012)","journal-title":"Algorithmica"},{"issue":"3,4","key":"47_CR18","doi-asserted-by":"crossref","first-page":"327","DOI":"10.3233\/FI-1996-253408","volume":"25","author":"K-J Lange","year":"1996","unstructured":"Lange, K.-J.: Complexity and structure in formal language theory. Fundam. Inf. 25(3,4), 327\u2013352 (1996)","journal-title":"Fundam. Inf."},{"issue":"4","key":"47_CR19","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/BF01212963","volume":"1","author":"P McKenzie","year":"1991","unstructured":"McKenzie, P., P\u00e9ladeau, P., Therien, D.: NC1: the automata-theoretic viewpoint. Comput. Complex. 1(4), 330\u2013359 (1991)","journal-title":"Comput. Complex."},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Pebbling moutain ranges and its application of dcfl-recognition. In: Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherland, 14\u201318 July 1980, Proceedings, pp. 422\u2013435 (1980)","DOI":"10.1007\/3-540-10003-2_89"},{"issue":"2","key":"47_CR21","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0022-0000(91)90020-6","volume":"43","author":"H Venkateswaran","year":"1991","unstructured":"Venkateswaran, H.: Properties that characterize LOGCFL. J. Comput. Syst. Sci. 43(2), 380\u2013404 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"47_CR22","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity - A Uniform Approach","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity - A Uniform Approach. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T03:41:53Z","timestamp":1600918913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}