Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A note on the characterization of TL[EF]
Information Processing Letters
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
How big must complete XML query languages be?
Proceedings of the 12th International Conference on Database Theory
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Finding your way in a forest: on different types of trees and their properties
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The common fragment of ACTL and LTL
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
| Hi-index | 0.01 |