A stronger recognizability condition for two-dimensional languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

A stronger recognizability condition for two-dimensional languages

Abstract

The paper presents a condition necessarily satisfied by (tiling system) recognizable two-dimensional languages. The new recognizability condition is compared with all the other ones known in the literature (namely three conditions), once they are put in a uniform setting: they are stated as bounds on the growth of some complexity functions defined for two-dimensional languages. The gaps between such functions are analyzed and examples are shown that asymptotically separate them. Finally the new recognizability condition results to be the strongest one, while the remaining ones are its particular cases. The problem of deciding whether a two-dimensional language is recognizable is here related to the one of estimating the minimal size of finite automata recognizing a sequence of (one-dimensional) string languages.
Fichier principal
Vignette du fichier
2113-8176-1-PB.pdf (198.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00980763 , version 1 (18-04-2014)

Identifiers

Cite

Marcella Anselmo, Maria Madonia. A stronger recognizability condition for two-dimensional languages. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 2 (2), pp.139--155. ⟨10.46298/dmtcs.599⟩. ⟨hal-00980763⟩

Collections

TDS-MACS
76 View
956 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More