We show how the classic BDD-based technique of implicit state enumeration for FSMs can be generalized to an automata-based approach for implicit state enumeration of FSMs interacting with datapaths of unbounded width. We present experimental results showing that our automata representation of an unbounded width datapath can be 10x more compact than the BDD representation of the corresponding 32...

In this paper, we study efficient computation of tree similarity for ordered trees based on compressed subtree enumeration. The compressed subtree enumeration is a new paradigm of enumeration algorithms that enumerates all subtrees of an input tree T in the form of their compressed bit signatures. For the task of enumerating all compressed bit signatures of k-subtrees in an ordered tree T , we ...

Lattice enumeration is a linear-space algorithm for solving the shortest lattice vector problem (SVP). Extreme pruning practical technique accelerating enumeration, which has mature theoretical analysis and implementation. However, these works have yet to be applied discrete pruning. In this paper, we improve pruned (DP enumeration) provide solution proposed by Léo Ducas Damien Stehlé regarding...

drop plate technique has a priority and preference compared with the spread plate procedure, because of less time, quantity of media, effort requirement, little incubator space, and less labor intensive. the objective of this research was to compare the accuracy and fidelity of drop plate method vs. spread plate method by parametric and nonparametric statistical tests. for bacterial enumeration...