![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 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](https://www.pdfsearch.io/img/7b4c5b0b1be0441df1ba8accebe037be.jpg) Date: 2014-06-27 10:56:07Computer 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 | | How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 1Add to Reading ListSource URL: software.imdea.orgDownload Document from Source Website File Size: 325,42 KBShare Document on Facebook
|