50 search results - page 4 / 10 » Regular Languages Are Testable with a Constant Number of Que... |
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
PODS
2010
ACM
14 years 15 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.)...
SCAM
2007
IEEE
14 years 1 months ago
2007
IEEE
—The access of information systems to underlying relational databases is commonly programmed using embedded SQL queries. Such embedded queries may take the form of string literal...
VLDB
2001
ACM
13 years 12 months ago
2001
ACM
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languag...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...