Abstract
The aim of this paper is to give regular expressions for two-dimensional picture languages. The paper focuses on a one-letter alphabet case, that corresponds to the study of “shapes” of families of pictures. A new diagonal concatenation operation is defined. Languages denoted by regular expressions with union, diagonal concatenation and its closure are characterized both in terms of rational relations and in terms of two-dimensional automata moving only right and down. The class of languages denoted by regular expressions with union, column, row and diagonal concatenation, and their closures are included in REC and strictly contains languages defined by three-way automata, but they are not comparable with ones defined by four-way automata. In order to encompass a wider class of languages, we propose some new operations that define languages that still lie in REC.
Work partially supported by MIUR Cofin: Linguaggi Formali e Automi: Metodi, Modelli e Applicazioni.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Transductions and Context-free Languages. Teubner (1979)
Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory, pp. 155–160 (1967)
De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by wang systems. Journal of Automata, Languages, Combinatorics 2, 269–288 (1997)
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)
Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae 25(3,4), 399–422 (1996)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages Vol. III, pp. 215–268. Springer Verlag, Heidelberg (1997)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13, 95–121 (1997)
Inoue, K., Nakamura, A.: Two-dimensional finite automata and unacceptable functions. Intern. J. Comput. Math. Sec. A 7, 207–213 (1979)
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. 654, Springer, Heidelberg (1993)
Inoue, K., Takanami, I., Nakamura, A.: A note on two-dimensional finite automata. Information Processing Letters 7(1), 49–52 (1978)
Kari, J., Moore, C.: Rectangles and squares recogized by two-dimensional automata, http://www.santafe.edu/~moore/pubs/picture.html
Kinber, E.B.: Three-way Automata on Rectangular Tapes over a One-Letter Alphabet. In: Information Sciences, vol. 35, pp. 61–77. Elsevier Sc. Publ, Amsterdam (1985)
Matz, O.: Regular expressions and Context-free Grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 283–294. Springer, Heidelberg (1997)
Rabin, M., Scott, T.: Finite automata and their decision problems. IBM Journal Res. and Dev. 3, 114–125 (1959)
Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theoretical Computer Science 218(2), 297–323 (1999)
Wilke, T.: Star-free picture expressions are strictly weaker than first-order logic. In: Proc. ICALP 1997. LNCS, vol. 1256, pp. 347–357. Springer-Verlag, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anselmo, M., Giammarresi, D., Madonia, M. (2004). Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)