The work presents some new algorithms realized recently in the package TESTAS. The package decides whether or not DFA is synchronizing, several procedures find
Using the linear space over the binary field that related to a graph G, a sufficient and necessary condition for the chromatic number of G is obtained.