Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Optimal Bounds for Transformations of omega-Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Tighter Bounds for the Determinisation of Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Tight bounds for the determinisation and complementation of generalised Büchi automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
In this paper we establish a lower bound hist(n ) for the problem of translating a Büchi word automaton of size n into a deterministic Rabin word automaton when both the Büchi and the Rabin condition label transitions rather than states. This lower bound exactly matches the known upper bound to this problem. The function hist(n ) is in *** ((1.64n ) n ) and in o ((1.65n ) n ). Our result entails a lower bound of hist(n *** 1) when the input Büchi automaton has its Büchi acceptance condition labeling states (as it is usual). Those lower bounds remain when the output deterministic Rabin automaton has its Rabin acceptance condition labeling states.