{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:18Z","timestamp":1725796818650},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319088457"},{"type":"electronic","value":"9783319088464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08846-4_2","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T11:56:43Z","timestamp":1404475003000},"page":"16-41","source":"Crossref","is-referenced-by-count":3,"title":["Restarting Automata for Picture Languages: A Survey on Recent Developments"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-73208-2_7","volume-title":"Developments in Language Theory","author":"M. Anselmo","year":"2007","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 36\u201347. Springer, Heidelberg (2007)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"3520","DOI":"10.1016\/j.tcs.2009.03.016","volume":"410","author":"A. Anselmo","year":"2009","unstructured":"Anselmo, A., Giammarresi, D., Madonia, M.: A computational model for tiling recognizable two-dimensional languages. Theor. Comput. Sci.\u00a0410, 3520\u20133529 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","first-page":"155","volume-title":"SWAT 1967","author":"M. Blum","year":"1967","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: SWAT 1967, pp. 155\u2013160. IEEE Computer Society, Washington, DC (1967)"},{"key":"2_CR4","first-page":"175","volume-title":"LATA 2007, Preproc. Report 35\/07","author":"B. Borchert","year":"2007","unstructured":"Borchert, B., Reinhardt, K.: Deterministically and sudoku-deterministically recognizable picture languages. In: Loos, R., Fazekas, S., Mart\u00edn-Vide, C. (eds.) LATA 2007, Preproc. Report 35\/07, pp. 175\u2013186. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona (2007)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-03564-7_2","volume-title":"Algebraic Informatics","author":"A. Cherubini","year":"2009","unstructured":"Cherubini, A., Pradella, M.: Picture Languages: From Wang Tiles to 2D Grammars. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol.\u00a05725, pp. 13\u201346. Springer, Heidelberg (2009)"},{"issue":"2-3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D. Giammarresi","year":"1992","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Intern. J. Pattern Recognition and Artificial Intelligence\u00a06(2-3), 241\u2013256 (1992)","journal-title":"Intern. J. Pattern Recognition and Artificial Intelligence"},{"key":"2_CR7","doi-asserted-by":"publisher","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.\u00a03, pp. 215\u2013267. Springer, New York (1997)"},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"F. Hennie","year":"1965","unstructured":"Hennie, F.: One-tape, off-line Turing machine computations. Informat. Control\u00a08(6), 553\u2013578 (1965)","journal-title":"Informat. Control"},{"key":"2_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1977","unstructured":"Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Inform. Sci.\u00a013, 95\u2013121 (1977)","journal-title":"Inform. Sci."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-56346-6_35","volume-title":"Parallel Image Analysis","author":"K. Inoue","year":"1992","unstructured":"Inoue, K., Takanami, I.: A characterization of recognizable picture languages. In: Nakamura, A., Saoudi, A., Inoue, K., Wang, P.S.P., Nivat, M. (eds.) ICPIA 1992. LNCS, vol.\u00a0654, pp. 133\u2013143. Springer, Heidelberg (1992)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-55808-X_29","volume-title":"Mathematical Foundations of Computer Science 1992","author":"P. Jan\u010dar","year":"1992","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M.: Characterization of context-free languages by erasing automata. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol.\u00a0629, pp. 307\u2013314. Springer, Heidelberg (1992)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-60249-6_60","volume-title":"Fundamentals of Computation Theory","author":"P. Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 283\u2013292. Springer, Heidelberg (1995)"},{"key":"2_CR14","first-page":"71","volume-title":"DLT 1999","author":"P. Ji\u0159i\u010dka","year":"2000","unstructured":"Ji\u0159i\u010dka, P., Kr\u00e1l, J.: Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata. In: Rozenberg, G., Thomas, W. (eds.) DLT 1999, pp. 71\u201380. World Scientific, Singapore (2000)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-44693-1_35","volume-title":"STACS 2001","author":"J. Kari","year":"2001","unstructured":"Kari, J., Moore, C.: New results on alternating and non-deterministic two-dimensional finite-state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 396\u2013406. Springer, Heidelberg (2001)"},{"issue":"5-6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K. Lindgren","year":"1998","unstructured":"Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. J. Stat. Phys.\u00a091(5-6), 909\u2013951 (1998)","journal-title":"J. Stat. Phys."},{"key":"2_CR17","first-page":"165","volume":"16","author":"H. Messerschmidt","year":"2011","unstructured":"Messerschmidt, H., Stommel, M.: Church-Rosser picture languages and their applications in picture recognition. J. Autom. Lang. Comb.\u00a016, 165\u2013194 (2011)","journal-title":"J. Autom. Lang. Comb."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-04921-2_44","volume-title":"Language and Automata Theory and Applications","author":"F. Otto","year":"2014","unstructured":"Otto, F., Mr\u00e1z, F.: Extended two-way ordered restarting automata for picture languages. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol.\u00a08370, pp. 541\u2013552. Springer, Heidelberg (2014)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-319-04298-5_38","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"F. Mr\u00e1z","year":"2014","unstructured":"Mr\u00e1z, F., Otto, F.: Ordered restarting automata for picture languages. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol.\u00a08327, pp. 431\u2013442. Springer, Heidelberg (2014)"},{"key":"2_CR20","series-title":"SCI","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-33461-3_11","volume-title":"Recent Advances in Formal Languages and Applications","author":"F. Otto","year":"2006","unstructured":"Otto, F.: Restarting automata. In: \u00c9sik, Z., Mart\u00edn-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. SCI, vol.\u00a025, pp. 269\u2013303. Springer, Heidelberg (2006)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-319-04921-2_45","volume-title":"Language and Automata Theory and Applications","author":"D. Pr\u016f\u0161a","year":"2014","unstructured":"Pr\u016f\u0161a, D.: Weight-reducing Hennie machines and their descriptional complexity. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol.\u00a08370, pp. 553\u2013564. Springer, Heidelberg (2014)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-31606-7_25","volume-title":"Implementation and Application of Automata","author":"D. Pr\u016f\u0161a","year":"2012","unstructured":"Pr\u016f\u0161a, D., Mr\u00e1z, F.: Restarting tiling automata. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 289\u2013300. Springer, Heidelberg (2012)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-31653-1_23","volume-title":"Developments in Language Theory","author":"D. Pr\u016f\u0161a","year":"2012","unstructured":"Pr\u016f\u0161a, D., Mr\u00e1z, F.: Two-dimensional sgraffito automata. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 251\u2013262. Springer, Heidelberg (2012)"},{"issue":"6","key":"2_CR24","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1142\/S0129054113400236","volume":"24","author":"D. Pr\u016f\u0161a","year":"2013","unstructured":"Pr\u016f\u0161a, D., Mr\u00e1z, F.: Restarting tiling automata. Intern. J. Found. Comput. Sci.\u00a024(6), 863\u2013878 (2013)","journal-title":"Intern. J. Found. Comput. Sci."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/978-3-642-39274-0_24","volume-title":"CIAA 2013","author":"D. Pr\u016f\u0161a","year":"2013","unstructured":"Pr\u016f\u0161a, D., Mr\u00e1z, F., Otto, F.: Comparing two-dimensional one-marker automata to sgraffito automata. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 268\u2013279. Springer, Heidelberg (2013)"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-38771-5_36","volume-title":"Developments in Language Theory","author":"D. Pr\u016f\u0161a","year":"2013","unstructured":"Pr\u016f\u0161a, D., Mr\u00e1z, F., Otto, F.: New results on deterministic sgraffito automata. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 409\u2013419. Springer, Heidelberg (2013)"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/BFb0055827","volume-title":"Mathematical Foundations of Computer Science 1998","author":"K. Reinhardt","year":"1998","unstructured":"Reinhardt, K.: On some recognizable picture-languages. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 760\u2013770. Springer, Heidelberg (1998)"},{"key":"2_CR28","unstructured":"Rosenfeld, A.: Isotonic grammars, parallel grammars, and picture grammars. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a06, pp. 281\u2013294. Edinburgh University Press (1971)"},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/S0146-664X(72)80019-4","volume":"1","author":"G. Siromoney","year":"1972","unstructured":"Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Computer Graphics and Image Processing\u00a01(3), 284\u2013307 (1972)","journal-title":"Computer Graphics and Image Processing"}],"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-08846-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:38:51Z","timestamp":1558939131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08846-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319088457","9783319088464"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08846-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}