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.

Anselmo, M., Giammarresi, D., Madonia, M. (2004). Regular expressions for two-dimensional languages over one-letter alphabet. In DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS (pp.63-75).

Regular expressions for two-dimensional languages over one-letter alphabet

GIAMMARRESI, DORA;
2004-01-01

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.
8th International Conference on Developments in Language Theory
Auckland, NEW ZEALAND
DEC 13-17, 2004
Assoc Theoret Comp Sci, Massey Univ, Univ Auckland, Ctr Discrete Math & Theoret Comp Sci
Rilevanza internazionale
contributo
2004
Settore INF/01 - INFORMATICA
English
FINITE AUTOMATA; PICTURE LANGUAGES
Intervento a convegno
Anselmo, M., Giammarresi, D., Madonia, M. (2004). Regular expressions for two-dimensional languages over one-letter alphabet. In DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS (pp.63-75).
Anselmo, M; Giammarresi, D; Madonia, M
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/33022
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
social impact