{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:45:59Z","timestamp":1725860759276},"publisher-location":"Cham","reference-count":9,"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_9","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T11:52:20Z","timestamp":1467719540000},"page":"101-112","source":"Crossref","is-referenced-by-count":0,"title":["A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata"],"prefix":"10.1007","author":[{"given":"Akio","family":"Fujiyoshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","volume":"7","author":"S Arnborg","year":"1986","unstructured":"Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods 7(2), 305\u2013314 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"9_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/PL00013549","volume":"3","author":"KF Chan","year":"2000","unstructured":"Chan, K.F., Yeung, D.Y.: Mathematical expression recognition: a survey. Int. J. Doc. Anal. Recogn. 3(1), 3\u201315 (2000)","journal-title":"Int. J. Doc. Anal. Recogn."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf. Comput. 85, 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"9_CR4","volume-title":"Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, Encyclopedia of Mathematics and Its Applications","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, Encyclopedia of Mathematics and Its Applications, vol. 138. Cambridge University Press, Cambridge (2012)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Eto, Y., Suzuki, M.: Mathematical formula recognition using virtual link network. In: Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), pp. 430\u2013437 (2001)","DOI":"10.1109\/ICDAR.2001.953891"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-642-02979-0_14","volume-title":"Implementation and Application of Automata","author":"A Fujiyoshi","year":"2009","unstructured":"Fujiyoshi, A.: Recognition of a spanning tree of directed acyclic graphs by tree automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol. 5642, pp. 105\u2013114. Springer, Heidelberg (2009)"},{"issue":"38\u201339","key":"9_CR7","doi-asserted-by":"crossref","first-page":"3493","DOI":"10.1016\/j.tcs.2010.06.006","volume":"411","author":"A Fujiyoshi","year":"2010","unstructured":"Fujiyoshi, A.: Recognition of directed acyclic graphs by spanning tree automata. Theor. Comput. Sci. 411(38\u201339), 3493\u20133506 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-319-08846-4_14","volume-title":"Implementation and Application of Automata","author":"A Fujiyoshi","year":"2014","unstructured":"Fujiyoshi, A.: Recognition of labeled multidigraphs by spanning tree automata. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 188\u2013199. Springer, Heidelberg (2014)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/978-3-540-85110-3_35","volume-title":"Intelligent Computer Mathematics","author":"A Fujiyoshi","year":"2008","unstructured":"Fujiyoshi, A., Suzuki, M., Uchida, S.: Verification of mathematical formulae based on a combination of context-free grammar and tree grammar. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC\/Calculemus\/MKM 2008. LNCS (LNAI), vol. 5144, pp. 415\u2013429. Springer, Heidelberg (2008)"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:50:47Z","timestamp":1498326647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}