遍历二叉树 meaning in Chinese

traversing binary tree

Traversing binary tree
遍历二叉树
In this paper , we discuss a kind of filter generator whose filter functions have less input bits than the degree of the linear feedback shift register ( lfsr ) . by analyzing the structure of the filter generator and its equivalent system , we give out a conditional search algorithm ( csa ) to attack this kind of filter generators
针对滤波函数f ( x )的输入比特数m少于线性反馈移位寄存器级数n的滤波生成器,本文通过分析其等价的组合生成器的结构,以及不同节拍上驱动序列的各个符号之间的制约关系,给出了广义解序列的概念,并提出了类似遍历二叉树的条件搜索算法csa ,用于攻击该类特殊的滤波序列。