{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:05Z","timestamp":1725497165496},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75414-5_9","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:22:54Z","timestamp":1196940174000},"page":"147-159","source":"Crossref","is-referenced-by-count":4,"title":["Deterministic Two-Dimensional Languages over One-Letter Alphabet"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-73208-2_7","volume-title":"Procs. DLT 2007","author":"M. Anselmo","year":"2007","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Procs. DLT 2007. LNCS, vol.\u00a04588, pp. 36\u201347. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.tcs.2005.03.031","volume":"340","author":"M. Anselmo","year":"2005","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: New Operators and Regular Expressions for two-dimensional languages over one-letter alphabet. Theoretical Computer Science\u00a0340(2), 408\u2013431 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1051\/ita:2006004","volume":"40","author":"M. Anselmo","year":"2006","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous Recognizable two-dimensional languages. RAIRO: Theoretical Informatics and Applications\u00a040(2), 227\u2013294 (2006)","journal-title":"RAIRO: Theoretical Informatics and Applications"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. STACS 07","author":"A. Bertoni","year":"2007","unstructured":"Bertoni, A., Goldwurm, M., Lonati, V.: On the complexity of unary tiling-recognizable picture languages. In: STACS 2007. LNCS, Springer, Heidelberg (2007)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory, pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"9_CR6","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"key":"9_CR7","first-page":"290","volume-title":"Procs. in Dev. on Language Theory 1993","author":"D. Giammarresi","year":"1994","unstructured":"Giammarresi, D.: Two-dimensional languages and recognizable functions. In: Rozenberg, G., Salomaa, A. (eds.) Procs. in Dev. on Language Theory 1993, pp. 290\u2013301. World Scientific Publishing Co., Singapore (1994)"},{"issue":"2&3","key":"9_CR8","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. Journal Pattern Recognition and Artificial Intelligence\u00a06(2&3), 241\u2013256 (1992)","journal-title":"Int. Journal Pattern Recognition and Artificial Intelligence"},{"key":"9_CR9","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., et al. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 215\u2013268. Springer, Heidelberg (1997)"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics\u00a016, 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"9_CR11","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. Information Sciences\u00a013, 95\u2013121 (1977)","journal-title":"Information Sciences"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/00207167908803172","volume":"A7","author":"K. Inoue","year":"1979","unstructured":"Inoue, K., Nakamura, A.: Two-dimensional finite automata and unacceptable functions. Intern. J. Comput. Math.\u00a0A7, 207\u2013213 (1979)","journal-title":"Intern. J. Comput. Math."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(89)90154-0","volume":"66","author":"A. Ito","year":"1989","unstructured":"Ito, A., Inoue, K., Takanami, I.: Deterministic two-dimensional On-line tesselation Acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\u00b0-rotation. Theor. Comp. Sc.\u00a066, 273\u2013287 (1989)","journal-title":"Theor. Comp. Sc."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1992)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(83)90093-2","volume":"27","author":"K. Inoue","year":"1983","unstructured":"Inoue, K., Takanami, I., Taniguchi, H.: Two-dimensional alternating Turing machines. Theor. Comp. Sc.\u00a027, 61\u201383 (1983)","journal-title":"Theor. Comp. Sc."},{"issue":"5-6","key":"9_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. Journal of Statistical Physics\u00a091(5-6), 909\u2013951 (1998)","journal-title":"Journal of Statistical Physics"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03113, pp. 134\u2013144. Springer, Heidelberg (2004), http:\/\/www.santafe.edu\/~moore\/pubs\/picture.html"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0255(85)90041-6","volume":"35","author":"E.B. Kinber","year":"1985","unstructured":"Kinber, E.B.: Three-way Automata on Rectangular Tapes over a One-Letter Alphabet. Information Sciences\u00a035, 61\u201377 (1985)","journal-title":"Information Sciences"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0023466","volume-title":"STACS 1997","author":"O. Matz","year":"1997","unstructured":"Matz, O.: Regular expressions and Context-free Grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 283\u2013294. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(01)00277-8","volume":"270","author":"O. Matz","year":"2002","unstructured":"Matz, O.: Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures. Theoretical Computer Science\u00a0270(1-2), 1\u201370 (2002)","journal-title":"Theoretical Computer Science"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.36045\/bbms\/1103408550","volume":"1","author":"A. Potthoff","year":"1994","unstructured":"Potthoff, A., Seibert, S., Thomas, W.: Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bull. Belgian Math. Soc.\u00a01, 285\u2013298 (1994)","journal-title":"Bull. Belgian Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:26:27Z","timestamp":1605763587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754138"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_9","relation":{},"subject":[]}}