Computer Science – Logic in Computer Science
Scientific paper
2009-01-24
International Journal of Foundations of Computer Science 15, 6 (2004) 823-840
Computer Science
Logic in Computer Science
An erratum is added at the end of the paper: The supremum of the set of Borel ranks of B\"uchi recognizable languages of infin
Scientific paper
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 $\omega^2$. 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 $\omega^2$ 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).
No associations
LandOfFree
On Recognizable Languages of Infinite Pictures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Recognizable Languages of Infinite Pictures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Recognizable Languages of Infinite Pictures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-454436