223 search results - page 16 / 45 » Construction of Tree Automata from Regular Expressions |
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
JSC
2010
13 years 6 months ago
2010
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
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...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
LICS
2002
IEEE
14 years 13 days ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...