{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:30Z","timestamp":1725558990690},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240143"},{"type":"electronic","value":"9783540305507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_6","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:06:05Z","timestamp":1278083165000},"page":"63-75","source":"Crossref","is-referenced-by-count":3,"title":["Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"Dora","family":"Giammarresi","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-free Languages. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"6_CR2","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":"6_CR3","first-page":"269","volume":"2","author":"L. Prophetis De","year":"1997","unstructured":"De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by wang systems. Journal of Automata, Languages, Combinatorics\u00a02, 269\u2013288 (1997)","journal-title":"Journal of Automata, Languages, Combinatorics"},{"key":"6_CR4","volume-title":"Proc., Developments in language theory, Finland, 1993","author":"D. Giammarresi","year":"1994","unstructured":"Giammarresi, D.: Two-dimensional languages and recognizable functions. In: Rozenberg, G., Salomaa, A. (eds.) Proc., Developments in language theory, Finland, 1993, World Scientific Publishing Co., Singapore (1994)"},{"issue":"3,4","key":"6_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-1996-253411","volume":"25","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae\u00a025(3,4), 399\u2013422 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages Vol. III","author":"D. Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages Vol. III, pp. 215\u2013268. Springer Verlag, Heidelberg (1997)"},{"key":"6_CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1997","unstructured":"Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences\u00a013, 95\u2013121 (1997)","journal-title":"Information Sciences"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/00207167908803172","volume":"7","author":"K. Inoue","year":"1979","unstructured":"Inoue, K., Nakamura, A.: Two-dimensional finite automata and unacceptable functions. Intern. J. Comput. Math. Sec. A\u00a07, 207\u2013213 (1979)","journal-title":"Intern. J. Comput. Math. Sec. A"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Image Analysis","author":"K. Inoue","year":"1993","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 (1993)"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0020-0190(78)90040-6","volume":"7","author":"K. Inoue","year":"1978","unstructured":"Inoue, K., Takanami, I., Nakamura, A.: A note on two-dimensional finite automata. Information Processing Letters\u00a07(1), 49\u201352 (1978)","journal-title":"Information Processing Letters"},{"key":"6_CR12","unstructured":"Kari, J., Moore, C.: Rectangles and squares recogized by two-dimensional automata, http:\/\/www.santafe.edu\/~moore\/pubs\/picture.html"},{"key":"6_CR13","first-page":"61","volume-title":"Information Sciences","author":"E.B. Kinber","year":"1985","unstructured":"Kinber, E.B.: Three-way Automata on Rectangular Tapes over a One-Letter Alphabet. In: Information Sciences, vol.\u00a035, pp. 61\u201377. Elsevier Sc. Publ, Amsterdam (1985)"},{"key":"6_CR14","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)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, T.: Finite automata and their decision problems. IBM Journal Res. and Dev.\u00a03, 114\u2013125 (1959)","journal-title":"IBM Journal Res. and Dev."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(98)00328-4","volume":"218","author":"D. Simplot","year":"1999","unstructured":"Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theoretical Computer Science\u00a0218(2), 297\u2013323 (1999)","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-63165-8_191","volume-title":"Proc. ICALP 1997","author":"T. Wilke","year":"1997","unstructured":"Wilke, T.: Star-free picture expressions are strictly weaker than first-order logic. In: Proc. ICALP 1997. LNCS, vol.\u00a01256, pp. 347\u2013357. Springer-Verlag, Heidelberg (1997)"}],"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-540-30550-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:19Z","timestamp":1605741679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}