On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland

First Page		Document Content
Date: 2007-06-16 19:01:23 Mathematical logic Mathematics Omega language Tree Wadge hierarchy Determinacy Symbol Regular language Ω-automaton Automata theory Formal languages Theoretical computer science		On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland Add to Reading List Source URL: www.mimuw.edu.pl Download Document from Source Website File Size: 249,40 KB Share Document on Facebook

	Introduction Open games Determinacy and the Axiom of Choice Axiom of Determinacy The Perfect Subset Property DocID: 1p68A - View Document
	Game characterizations of function classes and Weihrauch degrees MSc Thesis (Afstudeerscriptie) written by Hugo de Holanda Cunha Nobrega (born September 5, 1987 in Petrópolis, Brazil) DocID: 1nOgb - View Document
	Operations on a Wadge-Type Hierarchy of Ordinal-Valued Functions MSc Thesis (Afstudeerscriptie) written by Alexander C. Block (born November 10th , 1989 in Bad Segeberg, Germany) DocID: 1ne2m - View Document
	On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland DocID: 1guzu - View Document
	The Wadge Hierarchy of Deterministic Tree Languages Filip Murlak? Institute of Informatics, Warsaw University ul. Banacha 2, 02–097 Warszawa, Poland DocID: 1eCxI - View Document