Results 1 - 1 of 1
Decidability of S2S (2007)
by C Kissig
...sforming a given alternating F-automaton into an equivalent nondeterministic one is bound by the complexity of the Safra construction on ω-automata. This observation has been further substantiated in =-=-=- where it is shown in detail that both the lower and upper complexity bounds from the Safra construction on ω-automata yield the respective complexity bounds for transforming a given alternating tree ...
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2015 The Pennsylvania State University