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.

中文翻译：

---

用于测试某些可测试性的软件包TESTAS

我们执行一套程序来确定由其最小自动机或其句法半群给出的语言是否是本地可测试的，右或左本地可测试的，阈值本地可测试的，严格本地可测试的或分段可测试的。还找到了过渡图的局部可测性阶数和过渡半群的局部可测性阶数的界。对于给定的k，验证了过渡图的k-可检验性。使用了一些新的有效多项式时间算法。这些算法已实现为C / C ++程序包。