1805 search results - page 15 / 361 » A Theory of Closure Operators |
156
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
109
click to vote
ITA
2008
15 years 3 months ago
2008
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
125
click to vote
ICDT
2003
ACM
15 years 9 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
154
Voted
AOSD
2011
ACM
14 years 10 months ago
2011
ACM
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
123
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...