{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:25:04Z","timestamp":1743146704858,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_17","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"206-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata"],"prefix":"10.1007","author":[{"given":"Taylor J.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"issue":"2\u20133","key":"17_CR1","first-page":"143","volume":"98","author":"M Anselmo","year":"2010","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Deterministic and unambiguous families within recognizable two-dimensional languages. Fund. Inform. 98(2\u20133), 143\u2013166 (2010)","journal-title":"Fund. Inform."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-21254-3_7","volume-title":"Language and Automata Theory and Applications","author":"M Anselmo","year":"2011","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Classification of string languages via tiling recognizable picture languages. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 105\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_7"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: Miller, R.E. (ed.) SWAT 1967, pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"issue":"2\u20133","key":"17_CR4","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. Int. J. Pattern Recogn. Artif. Intell. 6(2\u20133), 241\u2013256 (1992)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"17_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, pp. 215\u2013267. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_4"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/321466.321470","volume":"15","author":"J Hartmanis","year":"1968","unstructured":"Hartmanis, J., Shank, H.: On the recognition of primes by automata. J. ACM 15(3), 382\u2013389 (1968)","journal-title":"J. ACM"},{"issue":"6","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14(6), 1087\u20131102 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"1\u20133","key":"17_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0255(91)90008-I","volume":"55","author":"K Inoue","year":"1991","unstructured":"Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Inf. Sci. 55(1\u20133), 99\u2013121 (1991)","journal-title":"Inf. Sci."},{"key":"17_CR10","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., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds.) ICPIA 1992. LNCS, vol. 654, pp. 133\u2013143. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-56346-6_35"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-27812-2_13","volume-title":"Theory Is Forever","author":"J Kari","year":"2004","unstructured":"Kari, J., Moore, C.: Rectangles and squares recognized by two-dimensional automata. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 134\u2013144. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27812-2_13"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"SY Kuroda","year":"1965","unstructured":"Kuroda, S.Y.: Classes of languages and linear-bounded automata. Inf. Control 7(2), 207\u2013223 (1965)","journal-title":"Inf. Control"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/inco.1997.2659","volume":"138","author":"M Latteux","year":"1997","unstructured":"Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Inf. Comput. 138(2), 160\u2013169 (1997)","journal-title":"Inf. Comput."},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Morita, K.: Two-dimensional languages. In: Mart\u00edn-Vide, C., Mitrana, V., P\u0103un, G. (eds.) Formal Languages and Applications, Studies in Fuzziness and Soft Computing, vol. 148, pp. 427\u2013437. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-39886-8_22","DOI":"10.1007\/978-3-540-39886-8_22"},{"key":"17_CR15","series-title":"Computer Science and Applied Mathematics","volume-title":"Picture Languages: Formal Models for Picture Recognition","author":"A Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Picture Languages: Formal Models for Picture Recognition. Computer Science and Applied Mathematics. Academic Press, New York (1979)"},{"key":"17_CR16","volume-title":"Theory of Automata, International Series of Monographs in Pure and Applied Mathematics","author":"A Salomaa","year":"1969","unstructured":"Salomaa, A.: Theory of Automata, International Series of Monographs in Pure and Applied Mathematics, vol. 100. Pergamon Press, Oxford (1969)"},{"key":"17_CR17","volume-title":"Formal Languages","author":"A Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"JC Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3(2), 198\u2013200 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"17_CR19","unstructured":"Smith, T.J.: Two-dimensional automata. Technical report 2019\u2013637. Queen\u2019s University, Kingston (2019)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-23679-3_18","volume-title":"Implementation and Application of Automata","author":"TJ Smith","year":"2019","unstructured":"Smith, T.J., Salomaa, K.: Decision problems for restricted variants of two-dimensional automata. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 222\u2013234. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23679-3_18"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Smith, T.J., Salomaa, K.: Concatenation operations and restricted variants of two-dimensional automata. arXiv:2008.11164 (2020)","DOI":"10.1007\/978-3-030-67731-2_11"},{"key":"17_CR22","series-title":"Computer Science and Technology Series","volume-title":"Theory of Computation","author":"D Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. Computer Science and Technology Series. Harper & Row, New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62536-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T12:05:46Z","timestamp":1741608346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}