91 search results - page 4 / 19 » Regular Expressions for Languages over Infinite Alphabets |
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
PODS
2010
ACM
14 years 17 days ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
NJC
2000
13 years 7 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
VLDB
2003
ACM
14 years 7 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...