Ω-automaton

Results: 90



#Item
1On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1  Universit´e de Lausanne, Switzerland

On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2007-06-16 19:01:23
2How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 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
3¨ Profile Trees for Buchi Word Automata, with Application to Determinization Seth Fogarty

¨ Profile Trees for Buchi Word Automata, with Application to Determinization Seth Fogarty

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2013-07-18 21:05:22
4Logic and Automata, Assignmentmarks) Construct B¨ uchi automata accepting ω-words satisfying the following LTL formulae: (a) G F X a

Logic and Automata, Assignmentmarks) Construct B¨ uchi automata accepting ω-words satisfying the following LTL formulae: (a) G F X a

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2010-11-21 13:28:41
5Regular Expressions for Languages over Infinite Alphabets (Extended abstract) Michael Kaminski1 and Tony Tan2 1

Regular Expressions for Languages over Infinite Alphabets (Extended abstract) Michael Kaminski1 and Tony Tan2 1

Add to Reading List

Source URL: alpha.uhasselt.be

Language: English - Date: 2013-09-27 07:35:34
6On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ?

On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ?

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2008-12-09 11:42:04
7On Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II Tony Tan School of Informatics, University of Edinburgh  Abstract

On Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II Tony Tan School of Informatics, University of Edinburgh Abstract

Add to Reading List

Source URL: alpha.uhasselt.be

Language: English - Date: 2013-09-27 07:35:34
8Tree Automata over Infinite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori

Tree Automata over Infinite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori

Add to Reading List

Source URL: alpha.uhasselt.be

Language: English - Date: 2013-09-27 07:35:34
9Uniform Distributed Synthesis Bernd Finkbeiner and Sven Schewe Universit¨at des Saarlandes Abstract

Uniform Distributed Synthesis Bernd Finkbeiner and Sven Schewe Universit¨at des Saarlandes Abstract

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2008-09-22 13:40:44
10Ramsey-Based Analysis of Parity Automata Oliver Friedmann1 and Martin Lange2 1 Dept. of Computer Science, Ludwig-Maximilians-University of Munich, Germany School of Electr. Eng. and Computer Science, University of Kassel

Ramsey-Based Analysis of Parity Automata Oliver Friedmann1 and Martin Lange2 1 Dept. of Computer Science, Ludwig-Maximilians-University of Munich, Germany School of Electr. Eng. and Computer Science, University of Kassel

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2012-02-10 07:43:13