First Page | Document Content | |
---|---|---|
![]() Date: 2008-09-23 06:27:20Formal methods Büchi automaton Ω-automaton Linear temporal logic SIGNAL Powerset construction Automata theory Theoretical computer science Computer science | Add to Reading List |
![]() | On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, SwitzerlandDocID: 1guzu - View Document |
![]() | How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 1DocID: 1fGRo - View Document |
![]() | ¨ Profile Trees for Buchi Word Automata, with Application to Determinization Seth FogartyDocID: 1aJuC - View Document |
![]() | Logic and Automata, Assignmentmarks) Construct B¨ uchi automata accepting ω-words satisfying the following LTL formulae: (a) G F X aDocID: 1aIwO - View Document |
![]() | Regular Expressions for Languages over Infinite Alphabets (Extended abstract) Michael Kaminski1 and Tony Tan2 1DocID: 1aFNF - View Document |