Repository landing page
An omega-power of a context-free language which is Borel above Delta^0_omega
Abstract
To appear in the Proceedings of the International Conference Foundations of the Formal Sciences V : Infinite Games, November 26th to 29th, 2004, Bonn, Germany, Stefan Bold, Benedikt Löwe, Thoralf Räsch, Johan van Benthem (eds.), College Publications at King's College (Studies in Logic), 2007.International audienceWe use erasers-like basic operations on words to construct a set that is both Borel and above Delta^0_omega, built as a set V^\omega where V is a language of finite words accepted by a pushdown automaton. In particular, this gives a first example of an omega-power of a context free language which is a Borel set of infinite rank- info:eu-repo/semantics/conferenceObject
- Conference papers
- Wadge games.
- Omega-language
- Context-free language
- Omega-power
- Cantor topology
- Topological complexity
- Borel hierarchy
- Borel ranks
- Infinite games
- Wadge games
- [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
- [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
- [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]
- [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
- [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]