Logical aspects in the study of tree languages
Proc. of the conference on Ninth colloquium on trees in algebra and programming
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
An algebraic characterization of frontier testable tree languages
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
The monadic second-order logic of graphs X: linear orderings
Theoretical Computer Science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Current trends in theoretical computer science
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
First-Order Logic on Finite Trees
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Regular Tree Languages Without Unary Symbols are Star-Free
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Temporal Logics over Unranked Trees
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A note on the characterization of TL[EF]
Information Processing Letters
Two-way unary temporal logic over trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
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
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
How big must complete XML query languages be?
Proceedings of the 12th International Conference on Database Theory
Algebra for Infinite Forests with an Application to the Temporal Logic EF
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An easy completeness proof for the modal µ-calculus on finite trees
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the recognized language can be defined by a formula in L. The logics L considered include path testable languages, frontier testable languages, fragments of Core XPath, and fragments of monadic second-order logic.