A package TESTAS for checking some kinds of testability

TL;DR

This paper introduces TESTAS, a C/C++ package that implements polynomial time algorithms to determine various types of testability in automata and semigroups, including local, threshold, and piecewise testability.

Contribution

The paper presents new algorithms and a software package for efficiently checking different testability properties of automata and semigroups.

Findings

Algorithms verify k-testability of transition graphs.

Bounds on local testability are established.

The package is implemented in C/C++ for practical use.

Abstract

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.