Universit¨at des Saarlandes Naturwissenschaftlich-Technische Fakult¨at 1 Fachrichtung Informatik Bachelor-Studiengang Informatik Bachelor’s Thesis

First Page		Document Content
Date: 2008-09-29 06:47:38 Applied mathematics Tree automaton Finite-state machine Alternating finite automaton Powerset construction Formal language Muller automaton Automata theory Theoretical computer science Computer science		Universit¨at des Saarlandes Naturwissenschaftlich-Technische Fakult¨at 1 Fachrichtung Informatik Bachelor-Studiengang Informatik Bachelor’s Thesis Add to Reading List Source URL: cgi.csc.liv.ac.uk Download Document from Source Website File Size: 272,18 KB Share Document on Facebook

	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
	Synthesis of Asynchronous Systems Sven Schewe and Bernd Finkbeiner Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany {schewe\|finkbeiner}@cs.uni-sb.de DocID: 1ac17 - View Document
	Satisability and Finite Model Property for the Alternating-Time -Cal ulus? Sven S hewe and Bernd Finkbeiner Universitat des Saarlandes, 66123 Saarbru ken, Germany fs hewejfinkbeinerg s.uni-sb.de DocID: 1aaj0 - View Document
	Universit¨at des Saarlandes Naturwissenschaftlich-Technische Fakult¨at 1 Fachrichtung Informatik Bachelor-Studiengang Informatik Bachelor’s Thesis DocID: 19WWO - View Document
	Distributed Synthesis for Alternating-Time Logics⋆ Sven Schewe and Bernd Finkbeiner Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany DocID: 19O3T - View Document