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

	On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland DocID: 1guzu - View Document
	How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 1 DocID: 1fGRo - View Document
	¨ Profile Trees for Buchi Word Automata, with Application to Determinization Seth Fogarty DocID: 1aJuC - View Document
	Logic and Automata, Assignmentmarks) Construct B¨ uchi automata accepting ω-words satisfying the following LTL formulae: (a) G F X a DocID: 1aIwO - View Document
	Regular Expressions for Languages over Infinite Alphabets (Extended abstract) Michael Kaminski1 and Tony Tan2 1 DocID: 1aFNF - View Document