{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:00Z","timestamp":1725558960242},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_44","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"515-526","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Evaluation of Nondeterministic Automata Using Factorization Forests"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Parys","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Koch, C.: XPath leashed. ACM Comput. Surv.\u00a041(1) (2008)","DOI":"10.1145\/1456650.1456653"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M.: Factorization forests. In: Developments in Language Theory, pp. 1\u201317 (2009)","DOI":"10.1007\/978-3-642-02737-6_1"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Parys, P.: XPath evaluation in linear time. In: PODS, pp. 241\u2013250 (2008)","DOI":"10.1145\/1376916.1376951"},{"key":"44_CR4","unstructured":"Colcombet, T.: On factorisation forests. CoRR, abs\/cs\/0701113 (2007)"},{"key":"44_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\n                    \n                    \n                   (release October 12, 2007)"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-85238-4_36","volume-title":"Mathematical Foundations of Computer Science 2008","author":"M. Kufleitner","year":"2008","unstructured":"Kufleitner, M.: The height of factorization forests. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 443\u2013454. Springer, Heidelberg (2008)"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Parys, P.: XPath evaluation in linear time with polynomial combined complexity. In: PODS, pp. 55\u201364 (2009)","DOI":"10.1145\/1559795.1559805"},{"issue":"1","key":"44_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I. Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theor. Comput. Sci.\u00a072(1), 65\u201394 (1990)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:40:29Z","timestamp":1558280429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}