New operations and regular expressions for two-dimensional languages over one-letter alphabet

Theoretical Computer Science

Volumn 340, Issue 2, 2005, Pages 408-431

  Anselmo, Marcella ^a   Giammarresi, Dora ^b   Madonia, Maria ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c UNIVERSITY OF CATANIA   (Italy)

Author keywords

Regular expression; Two dimensional language

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; FORMAL LOGIC; FUNCTIONS; NUMBER THEORY;

ALPHABETS; PICTURE LANGUAGES; REGULAR EXPRESSIONS; TWO DIMENSIONAL LANGUAGES;

FORMAL LANGUAGES;

EID: 20344396348     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.031     Document Type: Article

References (19)

1. M. Anselmo, D. Giammarresi, M. Madonia, Regular expressions for two-dimensional languages over one-letter alphabet, in: C.S. Calude, E. Calude, M.J. Dinneen (Eds.), Proc. Development in Language Theory (DLT 04), Lecture Notes in Computer Science, Vol. 3340, Springer, Berlin, 2004, pp. 63-75.
2. J. Berstel, Transductions and Context-free Languages, Teubner, 1979.
3. M. Blum, C. Hewitt, Automata on a two-dimensional tape, IEEE Symp. on Switching and Automata Theory, 1967, pp. 155-160.
4. L. De Prophetis, and S. Varricchio Recognizability of rectangular pictures by Wang systems J. Automat. Languages Combin. 2 1997 269 288
5. D. Giammarresi, Two-dimensional languages and recognizable functions, in: G. Rozenberg, A. Salomaa (Eds.), Proc. Developments in Language Theory, Finland, 1993, World Scientific Publishing Co., Singapore, 1994.
6. D. Giammarresi, and A. Restivo Two-dimensional finite state recognizability Fund. Inform. 25 3,4 1996 399 422
7. D. Giammarresi, A. Restivo, Two-dimensional languages, in: G. Rozenberg, et al. (Eds.), Handbook of Formal Languages, Vol. III, Springer, Berlin, 1997, pp. 215-268.
8. J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages and Computation 1979 Addison-Wesley Reading, MA
9. K. Inoue, and A. Nakamura Some properties of two-dimensional on-line tessellation acceptors Inform. Sci. 13 1977 95 121
10. K. Inoue, and A. Nakamura Two-dimensional finite automata and unacceptable functions Internat. J. Comput. Math. Sec. A 7 1979 207 213
11. K. Inoue, I. Takanami, A characterization of recognizable picture languages, in: Proc. Second Internat. Colloq. on Parallel Image Processing, Lecture Notes in Computer Science, Vol. 654, Springer, Berlin, 1993.
12. K. Inoue, I. Takanami, and A. Nakamura A note on two-dimensional finite automata Inform. Process. Lett. 7 1 1978 49 52
13. J. Kari, C. Moore, Rectangles and squares recognized by two-dimensional automata, In: J. Karhumaki, H. Maurer, G. Paun, G. Rozenburg (Eds.), Theory is Forever, Essays dedicated to Arto Salomaa on the occasion of his 70th birthday. LNCS 3113 (2004) 134-144.
14. E.B. Kinber Three-way automata on rectangular tapes over a one-letter alphabet Inform. Sci. 35 1985 61 77
15. O. Matz, Regular expressions and context-free grammars for picture languages, Proc. STACS'97, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 283-294.
16. O. Matz, On piecewise testable, starfree, and recognizable picture languages, in: M. Nivat (Ed.), Foundations of Software Science and Computation Structures, Vol. 1378, Springer, Berlin, 1998.
17. M. Rabin, and T. Scott Finite automata and their decision problems IBM J. Res. Dev. 3 1959 114 125
18. D. Simplot A characterization of recognizable picture languages by tilings by finite sets Theoret. Comput. Sci. 218 2 1999 297 323
19. T. Wilke, Star-free picture expressions are strictly weaker than first-order logic, in: Proc. ICALP'97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 347-357.