1243 search results - page 1 / 249 » Generating Trees on Multisets |
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
Given a multiset M = V1 V2
CATS
2008
13 years 6 months ago
2008
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
CSL
2007
Springer
13 years 8 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...