Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas -aache - Alea - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2012-05-29 11:02:51 Formal languages Computer science Theory of computation Ω-automaton Omega language Büchi automaton Symbol Determinacy Regular language Automata theory Mathematics Theoretical computer science		Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas}@automata.rwth-aache Add to Reading List Source URL: www.automata.rwth-aachen.de Download Document from Source Website File Size: 380,17 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