{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:47:47Z","timestamp":1740098867035,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591070"},{"type":"electronic","value":"9783319591087"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59108-7_7","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T04:43:06Z","timestamp":1494909786000},"page":"79-92","source":"Crossref","is-referenced-by-count":2,"title":["Template-Based Pattern Matching in Two-Dimensional Arrays"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Pr\u016f\u0161a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"7_CR1","first-page":"255","volume-title":"Algorithms and Complexity, Handbook of Theoretical Computer Science","author":"AV Aho","year":"1990","unstructured":"Aho, A.V.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Algorithms and Complexity, Handbook of Theoretical Computer Science, vol. A, pp. 255\u2013300. The MIT Press, Cambridge (1990)"},{"key":"7_CR2","unstructured":"Amir, A., Benson, G., Farach, M.: Alphabet independent two dimensional matching. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing, STOC 1992, NY, USA, pp. 59\u201368 (1992). http:\/\/doi.acm.org\/10.1145\/129712.129719"},{"issue":"3","key":"7_CR3","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741\u2013765 (1982)","journal-title":"J. ACM"},{"key":"7_CR4","unstructured":"Baeza-Yates, R., R\u00e9gnier, M.: Fast two-dimensional pattern matching. Inf. Process. Lett. 45(1), 51\u201357 (1993). http:\/\/www.sciencedirect.com\/science\/article\/pii\/002001909390250D"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Baker, T.P.: A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7(4), 533\u2013541 (1978). http:\/\/dx.doi.org\/10.1137\/0207043","DOI":"10.1137\/0207043"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bird, R.S.: Two dimensional pattern matching. Inf. Process. Lett. 6(5), 168\u2013170 (1977). http:\/\/dx.doi.org\/10.1016\/0020-0190(77)90017\u20135","DOI":"10.1016\/0020-0190(77)90017-5"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-26145-4_15","volume-title":"Combinatorial Image Analysis","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L., Thomas, D.G.: Scanning pictures the Boustrophedon way. In: Barneva, R.P., Bhattacharya, B.B., Brimkov, V.E. (eds.) IWCIA 2015. LNCS, vol. 9448, pp. 202\u2013216. Springer, Cham (2015). doi: 10.1007\/978-3-319-26145-4_15"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages","author":"D Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 215\u2013267. Springer, New York (1997)"},{"key":"7_CR9","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Two and higher dimensional pattern matching in optimal expected time. In: Sleator, D.D. (ed.) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, 23\u201325, pp. 715\u2013723. ACM\/SIAM (1994). http:\/\/dl.acm.org\/citation.cfm?id=314464.314680"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987). http:\/\/dx.doi.org\/10.1147\/rd.312.0249","DOI":"10.1147\/rd.312.0249"},{"key":"7_CR11","unstructured":"Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555\u20131578 (2012). http:\/\/www.fit.vutbr.cz\/research\/view_pub.php.cs?id=9795"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN \u201992","author":"J-E Pin","year":"1992","unstructured":"Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401\u2013416. Springer, Heidelberg (1992). doi: 10.1007\/BFb0023844"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-40946-7_20","volume-title":"Implementation and Application of Automata","author":"D Pr\u016f\u0161a","year":"2016","unstructured":"Pr\u016f\u0161a, D.: Complexity of sets of two-dimensional patterns. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 236\u2013247. Springer, Cham (2016). doi: 10.1007\/978-3-319-40946-7_20"},{"key":"7_CR14","unstructured":"Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Comput. Graph. Image Process. 1(3), 284\u2013307 (1972). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0146664X72800194"},{"issue":"1\u20132","key":"7_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.tcs.2004.07.010","volume":"328","author":"H Tamm","year":"2004","unstructured":"Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages. Theoret. Comput. Sci. 328(1\u20132), 135\u2013149 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Zhu, R.F., Takaoka, T.: A technique for two-dimensional pattern matching. ACM Commun. 32(9), 1110\u20131120 (1989). http:\/\/doi.acm.org\/10.1145\/66451.66459","DOI":"10.1145\/66451.66459"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59108-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T14:06:25Z","timestamp":1569333985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59108-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591070","9783319591087"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59108-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}