181 search results - page 1 / 37 » Effective characterizations of tree logics |
PODS
2008
ACM
14 years 7 months ago
2008
ACM
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...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
IJAC
2010
13 years 4 months ago
2010
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr
CONCUR
2004
Springer
14 years 26 days ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...