Corpus ID: 16551892

Decision Problems for Recognizable Languages of Infinite Pictures

@article{Finkel2011DecisionPF,
  title={Decision Problems for Recognizable Languages of Infinite Pictures},
  author={O. Finkel},
  journal={ArXiv},
  year={2011},
  volume={abs/1107.5896}
}
  • O. Finkel
  • Published 2011
  • Computer Science, Mathematics
  • ArXiv
Altenbernd, Thomas and Wohrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the Buchi and Muller ones, firstly used for infinite words. Many classical decision problems are studied in formal language theory and in automata theory and arise now naturally about recognizable languages of infinite pictures. We first review in this paper some recent results of [Fin09b… Expand
Some problems in automata theory which depend on the models of set theory
  • O. Finkel
  • Mathematics, Computer Science
  • RAIRO Theor. Informatics Appl.
  • 2011
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
  • O. Finkel
  • Mathematics, Computer Science
  • ICALP
  • 2015

References

SHOWING 1-10 OF 28 REFERENCES
Highly Undecidable Problems about Recognizability by Tiling Systems
  • O. Finkel
  • Mathematics, Computer Science
  • Fundam. Informaticae
  • 2009
On Recognizable Languages Of Infinite Pictures
  • O. Finkel
  • Mathematics, Computer Science
  • Int. J. Found. Comput. Sci.
  • 2004
The Complexity of Infinite Computations In Models of Set Theory
  • O. Finkel
  • Mathematics, Computer Science
  • Log. Methods Comput. Sci.
  • 2009
Highly Undecidable Problems For Infinite Computations
  • O. Finkel
  • Computer Science, Mathematics
  • RAIRO Theor. Informatics Appl.
  • 2009
On Recognizable Tree Languages Beyond the Borel Hierarchy
Automata on Infinite Objects
  • W. Thomas
  • Computer Science, Mathematics
  • Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Tiling Systems over Infinite Pictures and Their Acceptance Conditions
Logical Specifications of Infinite Computations
Decision problems for Turing machines
Infinite words - automata, semigroups, logic and games
  • D. Perrin, J. Pin
  • Computer Science, Mathematics
  • Pure and applied mathematics series
  • 2004
...
1
2
3
...