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

	Mathematical Foundations of Automata Theory ´ Jean-Eric Pin Version of June 15, 2018 DocID: 1uKeS - View Document
	CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Lecture 15 Andrej Bogdanov DocID: 1uDy7 - View Document
	Theory Comput Syst DOIs00224Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin DocID: 1tED6 - View Document
	Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata DocID: 1tDnH - View Document
	University of Warsaw Faculty of Mathematics, Informatics, and Mechanics Michał Skrzypczak Descriptive set theoretic methods in automata theory DocID: 1sU9J - View Document