Buchi - PDFSEARCH.IO - Document Search Engine

Buchi
Results: 132

#	Item
61	Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , and Orna Kupferman1 1 2 The Hebrew University, Israel. Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-10-15 08:28:09 Büchi automaton Regular language DFA minimization Finite-state machine Turing machine Deterministic automaton Ω-automaton Automata theory Theory of computation Theoretical computer science
62	Foundations of Software Technology and Theoretical Computer ScienceSubmission Quasi-Weak Cost Automata: A New Variant of Weakness∗ Denis Kuperberg1 , Michael Vanden Boom2 1 L IAFA /CNRS/Universit´ Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:51 Mathematics Ω-automaton Büchi automaton Semiautomaton Alphabet Finite-state machine Muller automaton Automata theory Theoretical computer science Computer science
63	LINEAR TEMPORAL LOGIC FOR REGULAR COST FUNCTIONS DENIS KUPERBERG Liafa/CNRS/Université Paris 7, Denis Diderot, France Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-05-08 11:47:02 Linear temporal logic Temporal logic Mathematical logic Semigroup Theoretical computer science Semigroup theory Büchi automaton Inverse semigroup Ω-automaton Automata theory Mathematics Algebraic structures
64	Determinisation of history-deterministic automata 1 1 Denis Kuperberg , Michał Skrzypczak Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-07-04 07:26:19 Büchi automaton Deterministic automaton Parity game Muller automaton Co-Büchi automaton Automata theory Theoretical computer science Computer science
65	ACRS_main-revised-april2014.dvi Add to Reading List Source URL: logica.ugent.be Language: English - Date: 2014-06-16 09:06:25 Logical consequence Logical syntax Metalogic Ordinal number Limit set Complementation of Büchi automaton Logic Deduction Entailment
66	Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if, Add to Reading List Source URL: spivey.oriel.ox.ac.uk Language: English - Date: 2010-02-09 12:35:41 Equivalence relation Structure Deterministic finite automaton If and only if Complementation of Büchi automaton Finite state transducer Automata theory Mathematics Models of computation
67	Nondeterminism in the Presence of a Diverse or Unknown Future ? Udi Boker1 , Denis Kuperberg2 , Orna Kupferman2 , and Michał Skrzypczak3 1 2 Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2013-04-29 05:18:08 Applied mathematics Ω-automaton Muller automaton Büchi automaton Tree automaton Finite-state machine Regular language Formal language Tree Automata theory Theoretical computer science Computer science
68	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
69	Unambiguous Finite Automata ¨ Christof Loding Department of Computer Science RWTH Aachen University, Germany Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-06-27 09:04:03 Büchi automaton Finite-state machine Deterministic automaton Muller automaton Automata theory Theoretical computer science Computer science
70	LTL-Model-Checking via Model Composition Ingo Felscher RWTH Aachen University, 52074 Aachen, Germany, [removed], http://automata.rwth-aachen.de/~felscher/ Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-03-01 05:03:49 Temporal logic Automata theory Model checking Model theory First-order logic Symbol Constructible universe Büchi automaton Well-formed formula Logic Mathematical logic Linear temporal logic

UPDATE