“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
Deciding equivalence of finite tree automata
SIAM Journal on Computing
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in 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
First-Order Logic on Finite Trees
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
CTL Model Checking for Processing Simple XPath Queries
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Classifying discrete temporal properties
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Eliminating recursion in the µ-calculus
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
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Games for Temporal Logics on Trees
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Characterization of Logics over Ranked Tree Languages
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Decidable Characterization of Locally Testable Tree Languages
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Algebra for Infinite Forests with an Application to the Temporal Logic EF
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency 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
Characterizing EF over infinite trees and modal logic on transitive graphs
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
| Hi-index | 0.00 |
The expressive power of temporal branching time logics that use the modalities EX and EF is described. Forbidden pattern characterizations are given for tree languages definable in three logics: EX, EF and EX + EF. The characterizations give algorithms for the definability problem in the respective logics that are polynomial in the size of a deterministic tree automaton representing the language.