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

	Equivalence of DFA and NFA • NFA’s are usually easier to “program” in. • Surprisingly, for any NFA N there is a DFA D, such that L(D) = L(N ), and vice versa. • This involves the subset construction, an impor DocID: 1qtyE - 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
	Universit¨at des Saarlandes Naturwissenschaftlich-Technische Fakult¨at 1 Fachrichtung Informatik Bachelor-Studiengang Informatik Bachelor’s Thesis DocID: 19WWO - View Document
	Decision Procedures for CTL∗ Oliver Friedmann and Markus Latte Dept. of Computer Science, University of Munich, Germany Abstract. We give an overview over three serious attempts to devise an eﬀective decision method DocID: 19Smu - View Document
	Synthesis of Reactive Systems Jens Regenberg <> IV DocID: 19lkA - View Document