On Recognizable Languages of Infinite Pictures
Abstract
In a recent paper, Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller ones, firstly used for infinite words. The authors asked for comparing the tiling system acceptance with an acceptance of pictures row by row using an automaton model over ordinal words of length . We give in this paper a solution to this problem, showing that all languages of infinite pictures which are accepted row by row by B\"uchi or Choueka automata reading words of length are B\"uchi recognized by a finite tiling system, but the converse is not true. We give also the answer to two other questions which were raised by Altenbernd, Thomas and W\"ohrle, showing that it is undecidable whether a B\"uchi recognizable language of infinite pictures is E-recognizable (respectively, A-recognizable).
Keywords
Cite
@article{arxiv.0901.3828,
title = {On Recognizable Languages of Infinite Pictures},
author = {Olivier Finkel},
journal= {arXiv preprint arXiv:0901.3828},
year = {2009}
}
Comments
An erratum is added at the end of the paper: The supremum of the set of Borel ranks of B\"uchi recognizable languages of infinite pictures is not the first non recursive ordinal $\omega_1^{CK}$ but an ordinal $\gamma^1_2$ which is strictly greater than the ordinal $\omega_1^{CK}$. This follows from a result proved by Kechris, Marker and Sami (JSL 1989)