{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:18Z","timestamp":1725730578917},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_36","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"409-419","source":"Crossref","is-referenced-by-count":7,"title":["New Results on Deterministic Sgraffito Automata"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Pr\u016f\u0161a","sequence":"first","affiliation":[]},{"given":"Franti\u0161ek","family":"Mr\u00e1z","sequence":"additional","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_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":"36_CR2","first-page":"155","volume-title":"Proceedings of the 8th Annual Symposium on Switching and Automata Theory, SWAT, FOCS 1967","author":"M. Blum","year":"1967","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: Proceedings of the 8th Annual Symposium on Switching and Automata Theory, SWAT, FOCS 1967, pp. 155\u2013160. IEEE Computer Society, Washington, DC (1967)"},{"key":"36_CR3","series-title":"Research Group on Mathematical Linguistics","first-page":"175","volume-title":"LATA","author":"B. Borchert","year":"2007","unstructured":"Borchert, B., Reinhardt, K.: Deterministically and sudoku-deterministically recognizable picture languages. In: Loos, R., Fazekas, S.Z., Mart\u00edn-Vide, C. (eds.) LATA. Research Group on Mathematical Linguistics, vol.\u00a035\/07, pp. 175\u2013186. Universitat Rovira i Virgili, Tarragona (2007)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Even, S., Even, G.: Graph Algorithms. Computer Software Engineering Series. Cambridge University Press (2011)","DOI":"10.1017\/CBO9781139015165"},{"key":"36_CR5","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":"36_CR6","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"F.C. Hennie","year":"1965","unstructured":"Hennie, F.C.: One-tape, off-line Turing machine computations. Information and Control\u00a08(6), 553\u2013578 (1965)","journal-title":"Information and Control"},{"key":"36_CR7","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":"36_CR8","first-page":"71","volume-title":"Developments in Language Theory","author":"P. Ji\u0159i\u010dka","year":"1999","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.) Developments in Language Theory, pp. 71\u201380. World Scientific, Singapore (1999)"},{"key":"36_CR9","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)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-11266-9_48","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"V. Lonati","year":"2010","unstructured":"Lonati, V., Pradella, M.: Picture recognizability with automata based on Wang tiles. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 576\u2013587. Springer, Heidelberg (2010)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-22256-6_21","volume-title":"Implementation and Application of Automata","author":"V. Lonati","year":"2011","unstructured":"Lonati, V., Pradella, M.: Towards more expressive 2D deterministic automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol.\u00a06807, pp. 225\u2013237. Springer, Heidelberg (2011)"},{"key":"36_CR12","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)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T08:36:01Z","timestamp":1688286961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}