Characterizing CTL-like logics on finite trees
We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic. (c) 2006 Elsevier B.V. All rights reserved.
cascade product tree automata temporal logic pseudovariety