Affiliation:
1. Equipe de Logique Mathématique, U.F.R. de Mathématiques, Université Paris 7, 2 Place Jussieu 75251 Paris cedex 05, France
Abstract
In a recent paper, Altenbernd, Thomas and Wöhrle 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üchi 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 ω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üchi or Choueka automata reading words of length ω2are Büchi 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öhrle, showing that it is undecidable whether a Büchi recognizable language of infinite pictures is E-recognizable (respectively, A-recognizable).
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Reference25 articles.
1. Tiling Systems over Infinite Pictures and Their Acceptance Conditions
2. N. Bedon, Finite Automata and Ordinals, Theoretical Computer Science 156 (1996) pp. 119–144.
3. Weak Second-Order Arithmetic and Finite Automata
4. J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic (Stanford University Press, 1962) pp. 1–11.
5. Lecture Notes in Mathematics;Büchi J. R.,1973
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献