1423 search results - page 120 / 285 » Languages of Nested Trees |
194
click to vote
ALP
1992
Springer
15 years 10 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
179
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
264
click to vote
PODS
2009
ACM
16 years 7 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...
164
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
184
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...