Logical aspects in the study of tree languages
Proc. of the conference on Ninth colloquium on trees in algebra and programming
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Modulo-counting quantifiers over finite trees
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
General varieties of tree languages
Theoretical Computer Science
First-Order Properties of Trees, Star-Free Expressions, adn Aperiodicity
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
An n! lower bound on formula size
ACM Transactions on Computational Logic (TOCL)
An Until Hierarchy for Temporal Logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A note on the characterization of TL[EF]
Information Processing Letters
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
Products of Tree Automata with an Application to Temporal Logic
Fundamenta Informaticae
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We associate a temporal logic XTL$({\mathcal L})$ with each class $\mathcal L$ of (regular) tree languages and provide both an algebraic and a game-theoretic characterization of the expressive power of the logic XTL($\mathcal L$).