The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Varieties Of Formal Languages
MSO Logic for Unambiguous Shared-Memory Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
LTL Model Checking of Time-Inhomogeneous Markov Chains
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
From LTL to symbolically represented deterministic automata
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Shared-memory systems and charts
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Schützenberger and Eilenberg theorems for words on linear orderings
Journal of Computer and System Sciences
Right-Sequential functions on infinite words
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Equivalence and inclusion problem for strongly unambiguous büchi automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
Efficient inclusion testing for simple classes of unambiguous ω-automata
Information Processing Letters
Effective characterizations of simple fragments of temporal logic using prophetic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
MSO on the infinite binary tree: choice and order
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
In this paper, we introduce a special class of Büchi automata called unambiguous. In these automata, any infinite word labels exactly one path going infinitely often through final states. The word is recognized by the automaton if this path starts in an initial state. The main result of the paper is that any rational set of infinite words is recognized by such an automaton. We give two proofs of this result. We also provide several related results.