109 search results - page 9 / 22 » Characterization of Logics over Ranked Tree Languages |
FUIN
2010
14 years 7 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
CLIMA
2007
14 years 11 months ago
2007
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
PODS
2010
ACM
15 years 2 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
MFCS
1998
Springer
15 years 2 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...