A stronger recognizability condition for two-dimensional languagesReportar como inadecuado

A stronger recognizability condition for two-dimensional languages - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 DIA - Dipartimento Informatica ed Applicazioni -Renato M. Capocelli- 2 DMI - Dipartimento di Matematica e Informatica

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.

Autor: Marcella Anselmo - Maria Madonia -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados