Collage of two-dimensional words - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2005

Collage of two-dimensional words

Résumé

We consider a new operation on one-dimensional (resp. two-dimensional) word languages, obtained by piling up, one on top of the other, words of a given recognizable language (resp. two-dimensional recognizable language) on a previously empty one-dimensional (resp. two-dimensional) array. The resulting language is the set of words “seen from above”: a position in the array is labeled by the topmost letter. We show that in the one-dimensional case, the language is always recognizable. This is no longer true in the two-dimensional case which is shown by a counter-example, and we investigate in which particular cases the result may still hold.

Dates et versions

hal-00158273 , version 1 (28-06-2007)

Identifiants

Citer

Christian Choffrut, Berke Durak. Collage of two-dimensional words. Theoretical Computer Science, 2005, 340 (1), pp.364-380. ⟨10.1016/j.tcs.2005.03.034⟩. ⟨hal-00158273⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More