Logical aspects in the study of tree languages
Proc. of the conference on Ninth colloquium on trees in algebra and programming
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
First-order logic and star-free sets
Journal of Computer and System Sciences
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
Introduction to algorithms
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
General varieties of tree languages
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Varieties Of Formal Languages
First-Order Properties of Trees, Star-Free Expressions, adn Aperiodicity
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
First-Order Logic on Finite Trees
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Verification of Reactive Systems: Formal Methods and Algorithms
Verification of Reactive Systems: Formal Methods and Algorithms
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Classifying discrete temporal properties
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Games for Temporal Logics on Trees
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
| Hi-index | 0.00 |
We provide structural descriptions of certain varieties of finite tree automata closed under a version of the cascade product, called the Moore product. As a byproduct, we obtain decidable characterizations of the expressive power of certain fragments of CTL on finite trees.