Alternating finite automaton - PDFSEARCH.IO - Document Search Engine

Alternating finite automaton
Results: 12

#	Item
1	How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 1 Add to Reading List Source URL: software.imdea.org Language: English - Date: 2014-06-27 10:56:07 Computer science Ω-automaton Deterministic finite automaton Nondeterministic finite automaton Linear temporal logic Finite-state machine Symbol Büchi automaton Automata theory Theoretical computer science Formal methods
2	Synthesis of Asynchronous Systems Sven Schewe and Bernd Finkbeiner Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany {schewe\|finkbeiner}@cs.uni-sb.de Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2008-09-22 13:39:05 Applied mathematics Ω-automaton Finite-state machine Scheduling Tree automaton Alternating finite automaton Powerset construction Automata theory Theoretical computer science Computer science
3	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 Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2009-04-30 04:31:43 Æ Ω-automaton Linguistics Notation Automata theory Centimetre–gram–second system of units Metrology
4	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 Language: English - 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
5	Distributed Synthesis for Alternating-Time Logics⋆ Sven Schewe and Bernd Finkbeiner Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2008-09-22 13:36:18 Tree automaton Finite-state machine Automata theory Theoretical computer science Computer science
6	Semi-Automatic Distributed Synthesis Bernd Finkbeiner and Sven Schewe Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany {finkbeiner\|schewe}@cs.uni-sb.de Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2008-09-22 13:39:26 Ω-automaton Tree automaton Finite-state machine Alternating finite automaton Automata theory Theoretical computer science Computer science
7	Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-08-07 05:31:08 Ω-automaton Büchi automaton Tree automaton Star height Alternating finite automaton Muller automaton Automata theory Theoretical computer science Computer science
8	Automata on Inifinite Trees Christof L¨oding Lehrstuhl Informatik 7 RWTH Aachen[removed]Aachen, Germany email: [removed] Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-05-29 10:55:51 Ω-automaton Muller automaton Alternating tree automata Tree automaton Alternating finite automaton Nondeterministic finite automaton Deterministic automaton Finite-state machine Parity game Automata theory Theoretical computer science Computer science
9	Methods for the Transformation of ω-Automata: Complexity and Connection to Second Order Logic Diploma Thesis (Revised Version) Christof L¨oding Supervisor: Prof. Dr. Wolfgang Thomas Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-05-29 10:55:56 Ω-automaton Nondeterministic finite automaton Muller automaton Finite-state machine Alternating finite automaton Sequence Powerset construction Automata theory Theoretical computer science Computer science
10	Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2013-07-10 12:10:51 Ω-automaton Büchi automaton Tree automaton Star height Alternating finite automaton Muller automaton Automata theory Theoretical computer science Computer science

UPDATE