General varieties of tree languages
Theoretical Computer Science
Verification of Reactive Systems: Formal Methods and Algorithms
Verification of Reactive Systems: Formal Methods and Algorithms
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Hi-index | 0.00 |
We introduce the notion of the Moore product of tree automata as a special case of the cascade product. We give an algebraic characterization of the expressive power of certain CTL-like temporal logics based on the notion of varieties of finite tree automata closed under the Moore product.