Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-00980763
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Friday, April 18, 2014 - 4:43:43 PM
Last modification on : Monday, October 19, 2020 - 8:02:03 PM
Long-term archiving on: : Monday, April 10, 2017 - 3:40:07 PM

File

2113-8176-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00980763, version 1

Collections

Citation

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

Share

Metrics

Record views

744

Files downloads

1132