  We implement a set of procedures for deciding whether or not a language given
by its minimal automaton or by its syntactic semigroup is locally testable,
right or left locally testable, threshold locally testable, strictly locally
testable, or piecewise testable. The bounds on order of local testability of
transition graph and order of local testability of transition semigroup are
also found. For given k, the k-testability of transition graph is verified.
Some new effective polynomial time algorithms are used. These algorithms have
been implemented as a C/C++ package.
