Wadge Degrees of Infinitary Rational Relations

@article{Finkel2008WadgeDO,
  title={Wadge Degrees of Infinitary Rational Relations},
  author={O. Finkel},
  journal={Mathematics in Computer Science},
  year={2008},
  volume={2},
  pages={85-102}
}
  • O. Finkel
  • Published 2008
  • Computer Science, Mathematics
  • Mathematics in Computer Science
Abstract.We show that, from the topological point of view, 2-tape Büchi automata have the same accepting power as Turing machines equipped with a Büchi acceptance condition. The Borel and the Wadge hierarchies of the class RATω of infinitary rational relations accepted by 2-tape Büchi automata are equal to the Borel and the Wadge hierarchies of ω-languages accepted by real-time Büchi 1-counter automata or by Büchi Turing machines. In particular, for every non-null recursive ordinal α, there… Expand
Infinite games specified by 2-tape automata
  • O. Finkel
  • Mathematics, Computer Science
  • Ann. Pure Appl. Log.
  • 2016
The Complexity of Infinite Computations In Models of Set Theory
  • O. Finkel
  • Mathematics, Computer Science
  • Log. Methods Comput. Sci.
  • 2009
Wadge Degrees of ω-Languages of Petri Nets
  • O. Finkel
  • Computer Science, Mathematics
  • ArXiv
  • 2017
On the High Complexity of Petri Nets ømega-Languages
  • O. Finkel
  • Mathematics, Computer Science
  • Petri Nets
  • 2020
The Wadge Hierarchy of Petri Nets omega-Languages
The Wadge Hierarchy of Petri Nets ω-Languages
Topological Complexity of Context-Free ω-Languages: A Survey
  • O. Finkel
  • Mathematics, Computer Science
  • Language, Culture, Computation
  • 2014
Topological Complexity of Context-Free omega-Languages: A Survey
...
1
2
...

References

SHOWING 1-10 OF 61 REFERENCES
Borel ranks and Wadge degrees of context free $\omega$-languages
  • O. Finkel
  • Computer Science, Mathematics
  • Mathematical Structures in Computer Science
  • 2006
On the Accepting Power of 2-Tape Büchi Automata
  • O. Finkel
  • Computer Science, Mathematics
  • STACS
  • 2006
Computer science and the fine structure of Borel sets
Relations rationnelles infinitaires
Decision problems forω-automata
  • L. Landweber
  • Computer Science, Mathematics
  • Mathematical systems theory
  • 2005
Automata on Infinite Objects
  • W. Thomas
  • Computer Science, Mathematics
  • Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Logic, semigroups and automata on words
  • J. Pin
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2005
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
  • O. Finkel
  • Mathematics, Computer Science
  • RAIRO Theor. Informatics Appl.
  • 2003
On omega-Regular Sets
  • K. Wagner
  • Computer Science, Mathematics
  • Inf. Control.
  • 1979
Chains and Superchains for ω-Rational Sets, Automata and Semigroups
...
1
2
3
4
5
...