The determinization of ω automata is an important part of theoretical computer research, and has important applications in formal verification, sequential logic, and model checking. Since the Büchiautomata was proposed for half a century, the deterministic algorithm of its automata has always been the basis of it. Different from the exploration of the upper and lower bounds of its size in theory at the beginning, the use of high-performance computer technology that is changing with each passing day is an effective auxiliary means. In order to deeply study the implementation process of the deterministic algorithm of non-deterministic Büchiautomata, we hope to focus on the question of whether the index can continue to be optimized, and realize the deterministic research tool NB2DR. The non-deterministic Büchiautomata can be determinized efficiently, and the determinization algorithm can be improved by analyzing the determinization process provided by the tool. A theoretical upper bound on correlation indexing is explored through an in-depth analysis of the indexing of generated deterministic ω automata. The tool also realizes that the deterministic Rabin automaton family can be generated according to the size of the required Büchiautomaton and the alphabet parameters, and it can also be reversed to generate all the Büchiautomata families according to the size of the specified index required, and the test generates ω Functions such as equivalence of automata.